Extensive Particle Swarm Artificial Bee Colony Algorithm for Function Optimization

Article Preview

Abstract:

An extensive particle swarm artificial bee colony algorithm is proposed, which integrates the global best solution into the solution search equation of artificial bee colony to improve the exploitation. The memory weight and neighborhood dynamic step are introduced to keep the balance between the global search and local search, and to improve the search accuracy. Particle swarm optimization is embedded into the modified algorithm for on-line parameter optimizing. The simulations have shown that the new algorithm outperforms the ABC algorithm on search accuracy, convergence rate and global search capability. It has been found many applications in optimization of manufacturing and design process.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1808-1811

Citation:

Online since:

January 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] G. P. Zhu and S. Kwong: Applied Mathematics and Computation Vol. 217 (2010) No. 7, pp.3166-3173.

Google Scholar

[2] J. X. Liu, Z. H. Jia, X. Z. Qin, C. Chang and H. Wang: Computer Engineering and Applications Vol. 49 (2013) No. 7, pp.119-122.

Google Scholar

[3] Y. Zhou, X. T. Zhang and L. Zhou: International Conference on Computer, Control, Education and Management (Dubai, United Arab Emirates, July 21-22, 2012) Vol. 27 (2012), pp.39-44.

Google Scholar

[4] D. Karaboga and B. Akay: Applied Mathematics and Computation Vol. 214 (2009) No. 1, pp.108-132.

Google Scholar