Dynamic multi-swarm particle swarm optimizer with harmony search

Expert Systems with Applications

Volumn 38, Issue 4, 2011, Pages 3735-3742

  Zhao, S Z ^a   Suganthan, P N ^a   Pan, Quan Ke ^b   Fatih Tasgetiren, M ^c  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b LIAOCHENG UNIVERSITY   (China)

^c YASAR UNIVERSITY   (Turkey)

Author keywords

Dynamic multi swarm particle swarm optimizer; Dynamic sub swarms; Harmony search; Multimodal optimization; Numerical optimization; Particle swarm optimizer

Indexed keywords

DYNAMIC MULTI SWARMS; HARMONY SEARCH; HS ALGORITHM; MULTI-MODAL; MULTI-MODAL OPTIMIZATION; NUMERICAL OPTIMIZATIONS; PARTICLE SWARM OPTIMIZERS; SUB-SWARMS; TEST PROBLEM;

ALGORITHMS; OPTIMIZATION; POPULATION STATISTICS;

DIAMONDS;

EID: 78650680946     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2010.09.032     Document Type: Article

References (20)

1. C.G. Broyden The convergence of a class of double-rank minimization algorithms Journal of the Institute of Mathematics and Applications 6 1970 76 90
2. M. Clerc, and J. Kennedy The particle swarm - explosion stability and convergence in a multidimensional complex space IEEE Transactions on Evolutionary Computation 6 1 2002 58 73
3. Davidon, W. C. (1959). Variable metric method for minimization. A.E.C. Research and Development Report, ANL-5990.
4. Eberhart, R. C.; Kennedy, J. (1995). A new optimizer using particle swarm theory. In Proceedings of the sixth international symposium on micromachine and human science, Nagoya, Japan (pp. 39-43).
5. R. Fletcher A new approach to variable metric algorithms Computer Journal 13 1970 317 322
6. R. Fletcher, and M.J.D. Powell A rapidly convergent descent method for minimization Computer Journal 6 1963 163 168
7. Z.W. Geem Particle-swarm harmony search for water network design Engineering Optimization 41 2009 297 311
8. D. Goldfarb A family of variable metric updates derived by variational means Mathematics of Computing 24 1970 23 26
9. Kennedy, J. (1999). Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance. In Proceedings of IEEE congress on evolutionary computation (CEC 1999), Piscataway, NJ (pp. 1931-1938).
10. Kennedy, J.; Eberhart, R. C. (1995). Particle swarm optimization. In Proceedings of IEEE international conference on neural networks, piscataway, NJ (pp. 1942-1948).
11. K. Lee, and Z.W. Geem A new meta-heuristic algorithm for continuous engineering optimization: Harmony search theory and practice Computer Methods in Applied Mechanics and Engineering 194 2005 3902 3933
12. Liang, J. J.; Suganthan, P. N. (2005). Dynamic multi-swarm particle swarm optimizer. In Proceedings of IEEE international swarm intelligence symposium (pp. 124-129).
13. Liang, J. J.; Suganthan, P. N.; Deb, K. (2005). Novel composition test functions for numerical global optimization. In Proceedings of Swarm Intelligence Symposium.
14. J.J. Liang, A.K. Qin, P.N. Suganthan, and S. Baskar Comprehensive learning particle swarm optimizer for global optimization of multimodal functions IEEE Transactions on Evolutionary Computation 10 3 2006 281 295
15. M.G.H. Omran, and M. Mahdavi Global-best harmony search Applied Mathematics and Computation 198 2 2008 643 656
16. D.F. Shanno Conditioning of Quasi-Newton methods for function minimization Mathematics of Computing 24 1970 647 656
17. Suganthan, P. N.; Hansen, N.; Liang, J. J.; Deb, K.; Chen, Y. -P.; Auger, A.; et al. (2005). Problem definitions and evaluation criteria for the CEC2005 special session on real-parameter optimization, Technical Report, Nanyang Technological University, Singapore, May 2005 AND KanGAL Report #2005005, IIT Kanpur, India. .
18. F. van den Bergh, and A.P. Engelbrecht A cooperative approach to particle swarm optimization IEEE Transactions on Evolutionary Computation 3 2004 225 239
19. M. Young The Technical writers handbook 1989 University Science Mill Valley, CA
20. K. Zielinski, and R. Laur Stopping criteria for a constrained single-objective particle swarm optimization algorithm Informatica 0350-5596 31 1 2007 51 59