Biogeography-based learning particle swarm optimization
This paper explores biogeography-based learning particle swarm optimization (BLPSO). Specifically, based on migration of biogeography-based optimization (BBO), a new biogeography-based learning strategy is proposed for particle swarm optimization (PSO), whereby each particle updates itself by using the combination of its own personal best position and personal best positions of all other particles through the BBO migration. The proposed BLPSO is thoroughly evaluated on 30 benchmark functions from CEC 2014. The results are very promising, as BLPSO outperforms five well-established PSO variants and several other representative evolutionary algorithms.
KeywordsParticle swarm optimization Biogeography-based learning Exemplar generation Biogeography-based optimization Migration
This work was partly supported by the Research Talents Startup Foundation of Jiangsu University (Grant No. 15JDG139), the China Postdoctoral Science Foundation (Grant No. 2016M591783), and the Natural Science Foundation of Jiangsu Province (Grant No. BK20160540). The authors would like to especially thank Dr. Wenyin Gong for his helpful comments on work of this paper. The authors would appreciate the scientific efforts of Dr. N. Hansen, Dr. C. Garcia-Martinez, Dr. J. Zhang, and Dr. Y. Jin in making available the source codes of CMAES, GL-25, JADE, and SL-PSO, and Dr. P. N. Suganthan for providing the source codes of CLPSO, DMSPSO, and SaDE.
Compliance with ethical standards
Conflict of interest
The author declares that there is no conflict of interest.
The work of this article does not involve use of human participants or animals.
- Eberchart RC, Kennedy J (1995) Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Network. Piscataway: IEEE Press, pp. 1942-1948Google Scholar
- Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science. New York, NY, pp. 39-43Google Scholar
- Kennedy J (1999) Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance. Evolutionary Computation, 1999. CEC 99.In: Proceedings of the 1999 Congress on. IEEEGoogle Scholar
- Liang J, Qu B, Suganthan P (2013) Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization. Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore, Computational Intelligence LaboratoryGoogle Scholar
- Liang JJ, Suganthan PN (2005) Dynamic multi-swarm particle swarm optimizer. Swarm Intelligence Symposium, 2005. SIS 2005.In: Proceedings 2005 IEEE. IEEE, pp. 124–129Google Scholar
- Parsopoulos KE, Vrahatis MN (2004) UPSO: a unified particle swarm optimization scheme. Lect Ser Comput Comput Sci 1:868–873Google Scholar
- Qin Q, Cheng S, Zhang Q, Li L (2015) Particle swarm optimization with interswarm interactive learning strategy. Cybern IEEE Trans. doi: 10.1109/TCYB.2015.2474153
- Shi Y, Eberhart R (1998) A modified particle swarm optimizer, Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on. IEEE, pp. 69–73Google Scholar
- Shi Y, Eberhart RC (2001) Fuzzy adaptive particle swarm optimization, Evolutionary Computation, (2001). In: Proceedings of the 2001 Congress on. IEEE, pp. 101–106Google Scholar
- Suganthan PN, Hansen N, Liang JJ, Deb K, Chen Y-P, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. KanGAL report 2005005Google Scholar
- Zhou X, Wu Z, Wang H, Rahnamayan S (2014) Gaussian bare-bones artificial bee colony algorithm. Soft Comput 20:1–18Google Scholar