Abstract
Bare-bones particle swarm optimization (BPSO) is attractive since it is parameter free and easy to implement. However, it suffers from premature convergence because of quickly losing diversity, and the dimensionality of the solved problems has great impact on the solution accuracy. To overcome these drawbacks, this paper proposes an opposition-based learning (OBL) modified strategy. First, to decrease the complexity of algorithm, OBL is not used for population initialization. Second, OBL is employed on the personal best positions (i.e., Pbest) to reconstruct Pbest, which is helpful to enhance convergence speed. Finally, we choose the global worst particle (Gworst) from Pbest, which simulates the human behavior and is called rebel learning item, and is integrated into the evolution equation of BPSO to help jump out local optima by changing the flying direction. The proposed modified BPSO is called BPSO-OBL, it has been evaluated on a set of well-known nonlinear benchmark functions in different dimensional search space, and compared with several variants of BPSO, PSOs and other evolutionary algorithms. Experimental results and statistic analysis confirm promising performance of BPSO-OBL on solution accuracy and convergence speed in solving majority nonlinear functions.
Similar content being viewed by others
References
Auger A, Hansen N (2005) Performance evaluation of an advanced local search evolutionary algorithm. In: The 2005 IEEE congress on evolutionary computation, vol 2, pp 1777–1784
Blackwell T (2012) A study of collapse in bare bones particle swarm optimization. IEEE Trans Evol comput 16(3):354–372
Chen CH, Sheu JS (2011) Unified bare bone particle swarm for economic dispatch with multiple fuel cost functions. In: 2011 7th Asia–Pacific international conference on lightning (APL), pp 214–219
Clerc M, Kennedy J (2002) The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Trans Evolut comput 6(1):58–73
Coelho LDS (2010) Gaussian quantum-behaved particle swarm optimization approaches for constrained engineering design problems. Expert Syst Appl 37(2):1676–1683
Garca S, Fernndez A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power. Inf Sci 180(10):2044–2064
Han L, He X (2007) A novel opposition-based particle swarm optimization for noisy problems. Third Int Conf Nat Comput 3:624–629
He G, Nj Huang (2012) A modified particle swarm optimization algorithm with applications. Appl Math Comput 219(3):1053–1060
Ho SY, Lin HS, Liauh WH, Ho SJ (2008) Opso: orthogonal particle swarm optimization and its application to task assignment problems. IEEE Trans Syst Man Cybern A Syst Hum 38(2):288–298
Hsiao YT, Lee WP, Wang RY (2014) A hybrid approach of dimension partition and velocity control to enhance performance of particle swarm optimization. Soft Comput 1–23
Hsieh HI, Lee TS (2010) A modified algorithm of bare bones particle swarm optimization. Int J Comput Sci Issues 7(6):12–17
Jabeen H, Jalil Z, Baig AR (2009) Opposition based initialization in particle swarm optimization (O-PSO). In: Proceedings of the 11th annual conference companion on genetic and evolutionary computation conference: late breaking papers, ACM, pp 2047–2052
Jiang Y, Li X, Huang C, Wu X (2013) Application of particle swarm optimization based on chks smoothing function for solving nonlinear bilevel programming problem. Appl Soft Comput 219(9):4332–4339
Kennedy J (2003) Bare bones particle swarms. In: Proceedings of the 2003 IEEE swarm intelligence symposium, pp 80–87
Kennedy J, Eberhart R (1995) Particle swarm optimization. IEEE Int Conf Neural Netw 4:1942–1948
Kennedy J, Mendes R (2002) Population structure and particle swarm performance. In: Proceedings of the 2002 congress on evolutionary computation, vol 2, pp 1671–1676
Krohling R, Mendel E (2009) Bare bones particle swarm optimization with Gaussian or Cauchy jumps. In: IEEE congress on evolutionary computation, pp 3285–3291
Liang JJ, Suganthan P (2005) Dynamic multi-swarm particle swarm optimizer. In: Proceedings of the 2005 IEEE swarm intelligence symposium, pp 124–129
Liang JJ, Qin AK, Suganthan P, Baskar S (2006) Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans Evolut comput 10(3):281–295
Leung Y-W, Wang Y (2001) An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans Evol Comput 5(1):41–53
Marinakis Y, Marinaki M (2013) Particle swarm optimization with expanding neighborhood topology for the permutation flowshop scheduling problem. Soft Comput 17(7):1159–1173
Marinakis Y, Iordanidou GR, Marinaki M (2013) Particle swarm optimization for the vehicle routing problem with stochastic demands. Appl Soft Comput 13(4):1693–1704
Mendes R, Kennedy J, Neves J (2004) The fully informed particle swarm: simpler, maybe better. IEEE Trans Evol comput 8(3):204–210
Omran MG, Engelbrecht AP, Salman A (2009) Bare bones differential evolution. Eur J Oper Res 196(1):128–139
Omran MGH, Al-Sharhan S (2008) Using opposition-based learning to improve the performance of particle swarm optimization. In: IEEE swarm intelligence symposium, SIS 2008, pp 1–6
Pluhacek M, Senkerik R, Zelinka I (2014) Particle swarm optimization algorithm driven by multichaotic number generator. Soft Comput 1–9
Shi Y, Eberhart R (1998) A modified particle swarm optimizer. In: IEEE international conference on evolutionary computation, pp 69–73
Suganthan PN, Hansen N, Liang JJ, Deb K, Chen S, Andari Y-P (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. In: Proceedings of the 2005 IEEE congress on evolutionary computation, pp 1–50
Tang J, Zhao X (2009) An enhanced opposition-based particle swarm optimization. In: WRI global congress on intelligent systems, GCIS ’09, vol 1, pp 149–153
Tizhoosh H (2005) Opposition-based learning: a new scheme for machine intelligence. Int Conf Comput Intell Model Control Autom Intell Agents Web Technol Internet Commer 1:695–701
Wang H (2012) Opposition-based barebones particle swarm for constrained nonlinear optimization problems. Math Probl Eng 2012:12
Wang H, Li H, Liu Y, Changhe L, Zeng S (2007) Opposition-based particle swarm algorithm with Cauchy mutation. In: IEEE congress on evolutionary computation, CEC 2007, pp 4750–4756
Wang H, Wu Z, Rahnamayan S, Liu Y, Ventresca M (2011) Enhancing particle swarm optimization using generalized opposition-based learning. Inf Sci 181(20):4699–4714
Wu Z, Ni Z, Zhang C, Gu L (2008) Opposition based comprehensive learning particle swarm optimization. In: 3rd international conference on intelligent system and knowledge engineering, vol 1, pp 1013–1019
Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evolut comput 3(2):82–102
Yao J, Han D (2013) Improved barebones particle swarm optimization with neighborhood search and its application on ship design. Math Probl Eng 2013:12
Zhan ZH, Zhang J, Li Y, Chung HH (2009) Adaptive particle swarm optimization. IEEE Trans Syst Man Cybern Syst B Cybern 39(6):1362–1381
Zhan ZH, Zhang J, Li Y, Hui Shi Y (2011) Orthogonal learning particle swarm optimization. IEEE Trans Evolut comput 15(6):832–847
Zhan ZH, Li JJ, Cao JN, Zhang J, Chung HSH, Shi YH (2013) Multiple populations for multiple objectives: a coevolutionary technique for solving multiobjective optimization problems. IEEE Trans Cybern 43(2):445–463
Zhang H, Kennedy DD, Rangaiah GP, Bonilla-Petriciolet A (2011) Novel bare-bones particle swarm optimization and its performance for modeling vapor liquid equilibrium data. Fluid Phase Equilib 301(1):33–45
Zhang J, Sanderson AC (2009) Jade: adaptive differential evolution with optional external archive. IEEE Trans Evol Comput 13(5):945–958
Zhang Y, Gong DW, Ding Z (2012) A bare-bones multi-objective particle swarm optimization algorithm for environmental/economic dispatch. Inf Sci 192:213–227
Acknowledgments
The authors wish to acknowledge the National Nature Science Foundation of China (Grant 61175127) for the financial support.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by V. Loia.
Rights and permissions
About this article
Cite this article
Liu, H., Xu, G., Ding, G. et al. Integrating opposition-based learning into the evolution equation of bare-bones particle swarm optimization. Soft Comput 19, 2813–2836 (2015). https://doi.org/10.1007/s00500-014-1444-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-014-1444-0