Skip to main content
Log in

Biogeography-based learning particle swarm optimization

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

Notes

  1. webpage of BBO http://embeddedlab.csuohio.edu/BBO/.

  2. The source codes of DMSPSO, FIPS, and CLPSO are provided by Dr. P.N. Suganthan, and the source code of SL-PSO is downloaded from Dr. Y. Jin’s homepage http://www.surrey.ac.uk/cs/research/nice/people/yaochu_jin/.

  3. The source codes of CMAES, GL-25, and JADE are downloaded from Dr. Y. Wang’s homepage http://ist.csu.edu.cn/YongWang.htm.

  4. The source code of our proposed BLPSO is available from the first author upon request.

References

  • Alcala-Fdez J, Sanchez L, Garcia S, del Jesus MJ, Ventura S, Garrell J, Otero J, Romero C, Bacardit J, Rivas VM (2009) KEEL: a software tool to assess evolutionary algorithms for data mining problems. Soft Comput 13:307–318

    Article  Google Scholar 

  • Chen DB, Zhao CX (2009) Particle swarm optimization with adaptive population size and its application. Appl Soft Comput 9:39–48

    Article  Google Scholar 

  • Cheng R, Jin Y (2015a) A competitive swarm optimizer for large scale optimization. Cybern IEEE Trans 45:191–204

    Article  Google Scholar 

  • Cheng R, Jin Y (2015b) A social learning particle swarm optimization algorithm for scalable optimization. Inf Sci 291:43–60

    Article  MATH  MathSciNet  Google Scholar 

  • Clerc M, Kennedy J (2002) The particle swarm-explosion, stability, and convergence in a multidimensional complex space. Evol Comput IEEE Trans 6:58–73

    Article  Google Scholar 

  • Eberchart RC, Kennedy J (1995) Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Network. Piscataway: IEEE Press, pp. 1942-1948

  • 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-43

  • Epitropakis MG, Plagianakos VP, Vrahatis MN (2012) Evolving cognitive and social experience in particle swarm optimization through differential evolution: a hybrid approach. Inf Sci 216:50–92

    Article  Google Scholar 

  • Fang W, Sun J, Chen H, Wu X (2016) A decentralized quantum-inspired particle swarm optimization algorithm with cellular structured population. Inf Sci 330:19–48

    Article  Google Scholar 

  • Garcia-Martinez C, Lozano M, Herrera F, Molina D, Sánchez AM (2008) Global and local real-coded genetic algorithms based on parent-centric crossover operators. Eur J Oper Res 185:1088–1113

    Article  MATH  Google Scholar 

  • Gong W, Cai Z, Ling CX (2010a) DE/BBO: a hybrid differential evolution with biogeography-based optimization for global numerical optimization. Soft Comput 15:645–665

    Article  Google Scholar 

  • Gong W, Cai Z, Ling CX, Li H (2010b) A real-coded biogeography-based optimization with mutation. Appl Math Comput 216:2749–2758

    MATH  MathSciNet  Google Scholar 

  • Gong Y-J, Li J-J, Zhou Y, Li Y, Chung HS-H, Shi Y-H, Zhang J (2015) Genetic learning particle swarm optimization. IEEE Trans Cybern. doi:10.1109/TCYB.2015.2475174

    Google Scholar 

  • Gulcu S, Kodaz H (2015) A novel parallel multi-swarm algorithm based on comprehensive learning particle swarm optimization. Eng Appl Artif Intell 45:33–45

    Article  Google Scholar 

  • Hansen N, Ostermeier A (2001) Completely derandomized self-adaptation in evolution strategies. Evol Comput 9:159–195

    Article  Google Scholar 

  • Hu M, Wu T-F, Weir JD (2013) An adaptive particle swarm optimization with multiple adaptive methods. Evol Comput IEEE Trans 17:705–720

    Article  Google Scholar 

  • Huang VL, Suganthan PN, Liang JJ (2006) Comprehensive learning particle swarm optimizer for solving multiobjective optimization problems. Int J Intell Syst 21:209–226

    Article  MATH  Google 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. IEEE

  • Li C, Yang S, Nguyen TT (2012) A self-learning particle swarm optimizer for global optimization problems. Syst Man Cybern Part B Cybern IEEE Trans 42:627–646

    Article  Google Scholar 

  • Li X, Wang J, Zhou J, Yin M (2011) A perturb biogeography based optimization with mutation for global numerical optimization. Appl Math Comput 218:598–609

    MATH  MathSciNet  Google 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 Laboratory

  • Liang JJ, Qin AK, Suganthan PN, Baskar S (2006) Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. Evol Comput IEEE Trans 10:281–295

    Article  Google 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–129

  • Lim WH, Isa NAM (2014a) Particle swarm optimization with adaptive time-varying topology connectivity. Appl Soft Comput 24:623–642

    Article  Google Scholar 

  • Lim WH, Isa NAM (2014b) Teaching and peer-learning particle swarm optimization. Appl Soft Comput 18:39–58

    Article  Google Scholar 

  • Lynn N, Suganthan PN (2015) Heterogeneous comprehensive learning particle swarm optimization with enhanced exploration and exploitation. Swarm Evol Comput 24:11–24

    Article  Google Scholar 

  • Ma H (2010) An analysis of the equilibrium of migration models for biogeography-based optimization. Inf Sci 180:3444–3464

    Article  MATH  Google Scholar 

  • Mendes R, Kennedy J, Neves J (2004) The fully informed particle swarm: simpler, maybe better. Evol Comput IEEE Trans 8:204–210

    Article  Google Scholar 

  • Nickabadi A, Ebadzadeh MM, Safabakhsh R (2011) A novel particle swarm optimization algorithm with adaptive inertia weight. Appl Soft Comput 11:3658–3670

    Article  Google Scholar 

  • Ouyang HB, Gao LQ, Kong XY, Li S, Zou DX (2016) Hybrid harmony search particle swarm optimization with global dimension selection. Inf Sci 346:318–337

    Article  Google Scholar 

  • Parsopoulos KE, Vrahatis MN (2004) UPSO: a unified particle swarm optimization scheme. Lect Ser Comput Comput Sci 1:868–873

    Google Scholar 

  • Poli R (2009) Mean and variance of the sampling distribution of particle swarm optimizers during stagnation. IEEE Trans Evol Comput 13:712–721

    Article  Google 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

  • Robinson J, Sinton S, Rahmat-Samii Y (2002) Particle swarm, genetic algorithm, and their hybrids: optimization of a profiled corrugated horn antenna. AP-S Int Symp (Dig) (IEEE Antennas Propag Soc) 1:314–317

    Article  Google Scholar 

  • Sheng-Ta H, Tsung-Ying S, Chan-Cheng L, Shang-Jeng T (2009) Efficient population utilization strategy for particle swarm optimizer. Syst Man Cybern Part B Cybern IEEE Trans 39:444–456

    Article  Google Scholar 

  • 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–73

  • Shi Y, Eberhart RC (2001) Fuzzy adaptive particle swarm optimization, Evolutionary Computation, (2001). In: Proceedings of the 2001 Congress on. IEEE, pp. 101–106

  • Simon D (2008) Biogeography-based optimization. Evol Comput IEEE Trans 12:702–713

    Article  Google 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 2005005

  • Yu X, Zhang X (2014) Enhanced comprehensive learning particle swarm optimization. Appl Math Comput 242:265–276

    MATH  MathSciNet  Google Scholar 

  • Zhan Z-H, Zhang J, Li Y, Shi Y-H (2011) Orthogonal learning particle swarm optimization. Evol Comput IEEE Trans 15:832–847

    Article  Google Scholar 

  • Zhang J, Sanderson AC (2009) JADE: adaptive differential evolution with optional external archive. Evol Comput IEEE Trans 13:945–958

    Article  Google Scholar 

  • Zhou X, Wu Z, Wang H, Rahnamayan S (2014) Gaussian bare-bones artificial bee colony algorithm. Soft Comput 20:1–18

Download references

Acknowledgments

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.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xu Chen.

Ethics declarations

Conflict of interest

The author declares that there is no conflict of interest.

Ethical approval

The work of this article does not involve use of human participants or animals.

Additional information

Communicated by V. Loia.

Appendix 1. Migration models of BBO

Appendix 1. Migration models of BBO

Ma (2010) provided six mathematical migration models for BBO. The six migration models can be used to design the biogeography-based exemplar generation method for BLPSO, and they are described as follows:

Model 1 (constant immigration and linear emigration model):

$$\begin{aligned} \left\{ {\begin{array}{l} \lambda _k =\frac{1}{2}\cdot I \\ \mu _k =\frac{k}{N}\cdot E \\ \end{array}} \right. \end{aligned}$$
(10)

Model 2 (linear immigration and constant emigration model)

$$\begin{aligned} \left\{ {\begin{array}{l} \lambda _k =\left( {1-\frac{k}{N}} \right) \cdot I \\ \mu _k =\frac{1}{2}\cdot E \\ \end{array}} \right. \end{aligned}$$
(11)

Model 3 (linear migration model):

$$\begin{aligned} \left\{ {\begin{array}{l} \lambda _k =\left( {1-\frac{k}{N}} \right) \cdot I \\ \mu _k =\left( {\frac{k}{N}} \right) \cdot E \\ \end{array}} \right. \end{aligned}$$
(12)

Model 4 (trapezoidal migration model)

$$\begin{aligned} \left\{ {\begin{array}{l} \lambda _k =\left\{ {\begin{array}{l} Ik\le {i}' \\ 2\left( {1-\frac{k}{N}} \right) \cdot I, \quad {i}'<k\le ps \\ \end{array}} \right. \\ \mu _k =\left\{ {\begin{array}{l} \left( {\frac{2k}{N}} \right) \cdot E, \quad k\le {i}' \\ E, \quad {i}'<k\le ps \\ \end{array}} \right. \\ \end{array}} \right. \end{aligned}$$
(13)

where \({i}'=ceil\left( {(ps+1)/2} \right) \)

Model 5 (quadratic migration model):

$$\begin{aligned} \left\{ {\begin{array}{l} \lambda _k =\left( {1-\frac{k}{N}} \right) ^{2}\cdot I \\ \mu _k =\left( {\frac{k}{N}} \right) ^{2}\cdot E \\ \end{array}} \right. \end{aligned}$$
(14)

Model 6 (sinusoidal migration model):

$$\begin{aligned} \left\{ {\begin{array}{l} \lambda _k =\frac{1}{2}\left( {\cos \left( {\frac{k\pi }{N}} \right) +1} \right) \cdot I \\ \mu _k =\frac{1}{2}\left( {-\cos \left( {\frac{k\pi }{N}} \right) +1} \right) \cdot E \\ \end{array}} \right. \end{aligned}$$
(15)

In Eqs. (10)–(15), I and E are the maximum possible immigration and emigration rates; N is the population size; k is the index of the individual with rank k, where \(k=1\) refers to the worst individual and \(k=N\) refers to the best individual.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, X., Tianfield, H., Mei, C. et al. Biogeography-based learning particle swarm optimization. Soft Comput 21, 7519–7541 (2017). https://doi.org/10.1007/s00500-016-2307-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-016-2307-7

Keywords

Navigation