×

A dynamic global and local combined particle swarm optimization algorithm. (English) Zbl 1198.90012

Summary: Particle swarm optimization (PSO) algorithm has been developing rapidly and many results have been reported. PSO algorithm has shown some important advantages by providing high speed of convergence in specific problems, but it has a tendency to get stuck in a near optimal solution and one may find it difficult to improve solution accuracy by fine tuning. This paper presents a dynamic global and local combined particle swarm optimization (DGLCPSO) algorithm to improve the performance of original PSO, in which all particles dynamically share the best information of the local particle, global particle and group particles. It is tested with a set of eight benchmark functions with different dimensions and compared with original PSO. Experimental results indicate that the DGLCPSO algorithm improves the search performance on the benchmark functions significantly, and shows the effectiveness of the algorithm to solve optimization problems.
Editorial remark: There are doubts about a proper peer-reviewing procedure of this journal. The editor-in-chief has retired, but, according to a statement of the publisher, articles accepted under his guidance are published without additional control.

MSC:

90-04 Software, source code, etc. for problems pertaining to operations research and mathematical programming
90C39 Dynamic programming
90C59 Approximation methods and heuristics in mathematical programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Eberhart R, Kennedy J. A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science, Nagoya, Japan; 1995. p. 39-43.; Eberhart R, Kennedy J. A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science, Nagoya, Japan; 1995. p. 39-43.
[2] Kennedy J, Eberhart R. Particle swarm optimization. In: IEEE international conference on neural networks, Perth, Australia; 1995. p. 1942-48.; Kennedy J, Eberhart R. Particle swarm optimization. In: IEEE international conference on neural networks, Perth, Australia; 1995. p. 1942-48.
[3] Clerc, M.; Kennedy, J., The particle swarm: explosion stability and convergence in a multi-dimensional complex space, IEEE Trans Evol Comput, 6, 1, 58-73 (2002)
[4] Eberhart RC, Shi Y. Particle swarm optimization: developments, applications and resources. In: Proceedings of IEEE international conference on evolutionary computation; 2001. p. 81-6.; Eberhart RC, Shi Y. Particle swarm optimization: developments, applications and resources. In: Proceedings of IEEE international conference on evolutionary computation; 2001. p. 81-6.
[5] Shi Y, Eberhart RC. A modified particle swarms optimiser. In: Proceedings of the IEEE international conference on evolutionary computation; 1997. p. 303-8.; Shi Y, Eberhart RC. A modified particle swarms optimiser. In: Proceedings of the IEEE international conference on evolutionary computation; 1997. p. 303-8.
[6] Shi Y, Eberhart R. A modified particle swarm optimizer. In: IEEE world congress on computational intelligence; 1998. p. 69-73.; Shi Y, Eberhart R. A modified particle swarm optimizer. In: IEEE world congress on computational intelligence; 1998. p. 69-73.
[7] He, S.; Wu, Q. H.; Wen, J. Y.; Saunders, J. R.; Paton, R. C., A particle swarm optimizer with passive congregation, BioSystems, 78, 135-147 (2004)
[8] Shi Y, Eberhart RC. Parameter selection in particle swarm optimization. In: Evolutionary programming VII: proceedings of the seventh annual conference on evolutionary programming, New York; 1998. p. 591-600.; Shi Y, Eberhart RC. Parameter selection in particle swarm optimization. In: Evolutionary programming VII: proceedings of the seventh annual conference on evolutionary programming, New York; 1998. p. 591-600.
[9] Kennedy J. Stereotyping: improving particle swarm performance with cluster analysis. In: Proceedings of the IEEE international conference on evolutionary computation; 2000. p. 1507-12.; Kennedy J. Stereotyping: improving particle swarm performance with cluster analysis. In: Proceedings of the IEEE international conference on evolutionary computation; 2000. p. 1507-12.
[10] Kennedy J, Mendes R. Population structure and particle swarm performance. In: Proceedings of the 2002 congress on evolutionary computation CEC2002, IEEE Press; 2002. p. 1671-6.; Kennedy J, Mendes R. Population structure and particle swarm performance. In: Proceedings of the 2002 congress on evolutionary computation CEC2002, IEEE Press; 2002. p. 1671-6.
[11] Angeline PJ. Using selection to improve particle swarm optimization. In: IEEE international conference on evolutionary computation, Anchorage, Alaska; 1998. p. 231-8.; Angeline PJ. Using selection to improve particle swarm optimization. In: IEEE international conference on evolutionary computation, Anchorage, Alaska; 1998. p. 231-8.
[12] Lovbjerg M, Rasmussen TK, Krink T. Hybrid particle swarm optimization with breeding and subpopulations. In: IEEE international conference on evolutionary computation, San Diego; 2000. p. 1217-22.; Lovbjerg M, Rasmussen TK, Krink T. Hybrid particle swarm optimization with breeding and subpopulations. In: IEEE international conference on evolutionary computation, San Diego; 2000. p. 1217-22.
[13] Van den Bergh F, Engelbrecht AP. Training product unit networks using cooperative particle swarm optimizer. In: Proceedings of the third genetic and evolution computation conference (CEOCCO), San Francisco, USA; 2001.; Van den Bergh F, Engelbrecht AP. Training product unit networks using cooperative particle swarm optimizer. In: Proceedings of the third genetic and evolution computation conference (CEOCCO), San Francisco, USA; 2001.
[14] Van den Bergh F, Engelbrecht AP. Effects of swarm size on cooperative particle swarm optimizers. In: Proceedings of the CECCO, San Francisco, USA; 2001.; Van den Bergh F, Engelbrecht AP. Effects of swarm size on cooperative particle swarm optimizers. In: Proceedings of the CECCO, San Francisco, USA; 2001.
[15] Shi Y, Eberhart RC. A new particle swarm optimizer. In: IEEE World Congress on Computational Intelligence; 1998. p. 69-73.; Shi Y, Eberhart RC. A new particle swarm optimizer. In: IEEE World Congress on Computational Intelligence; 1998. p. 69-73.
[16] Liu, Bo, Improved particle swarm optimization combined with chaos, Chaos, Solitons & Fractals, 25, 1261-1271 (2005) · Zbl 1074.90564
[17] Coelho, Leandro dos Santos, A quantum particle swarm optimizer with chaotic mutation operator, Chaos, Solitons & Fractals, 37, 1409-1418 (2008)
[18] Coelho, Leandro dos Santos; Coelho, Antonio Augusto Rodrigues, Model-free adaptive control optimization using a chaotic particle swarm approach, Chaos, Solitons & Fractals (2008) · Zbl 1198.90403
[19] Alatas, Bilal; Akin, Erhan, Chaotically encoded particle swarm optimization algorithm and its applications, Chaos, Solitons & Fractals (2008) · Zbl 1141.68551
[20] Alatas, Bilal; Akin, Erhan; Bedri Ozer, A., Chaos embedded particle optimization algorithms, Chaos, Solitons & Fractals (2008) · Zbl 1198.90400
[21] Coelho, Leandro dos Santos; Mariani, Viviana Cocco, A novel chaotic particle swarm optimization approach using Henon map and implicit filtering local search for economic load dispatch, Chaos, Solitons & Fractals (2007) · Zbl 1278.90498
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.