Advertisement

Natural Computing

, Volume 13, Issue 1, pp 17–37 | Cite as

Quadratic interpolation based orthogonal learning particle swarm optimization algorithm

  • Ruochen Liu
  • Lixia Wang
  • Wenping Ma
  • Caihong Mu
  • Licheng Jiao
Article

Abstract

Particle swarm optimization (PSO) is a population based algorithm for solving global optimization problems. Owing to its efficiency and simplicity, PSO has attracted many researchers’ attention and developed many variants. Orthogonal learning particle swarm optimization (OLPSO) is proposed as a new variant of PSO that relies on a new learning strategy called orthogonal learning strategy. The OLPSO differs in the utilization of the information of experience from the standard PSO, in which each particle utilizes its historical best experience and globally best experience through linear summation. In OLPSO, particles can fly in better directions by constructing an efficient exemplar through orthogonal experimental design. However, the global version based orthogonal learning PSO (OLPSO-G) still have some drawbacks in solving some complex multimodal function optimization. In this paper, we proposed a quadratic interpolation based OLPSO-G (QIOLPSO-G), in which, a quadratic interpolation based construction strategy for the personal historical best experience is applied. Meanwhile, opposition-based learning, and Gaussian mutation are also introduced into this paper to increase the diversity of the population and discourage the premature convergence. Experiments are conducted on 16 benchmark problems to validate the effectiveness of the QIOLPSO-G, and comparisons are made with four typical PSO algorithms. The results show that the introduction of the three strategies does enhance the effectiveness of the algorithm.

Keywords

Gaussian mutation Opposition-based learning Orthogonal learning Particle swarm optimization Quadratic interpolation 

Notes

Acknowledgments

This work was supported by the National Natural Science Foundation of China (Nos. 61373111, 61272279, 61003199 and 61203303); the Fundamental Research Funds for the Central Universities (Nos. K50511020014, K5051302084, K50510020011, K5051302049, and K5051302023); the Fund for Foreign Scholars in University Research and Teaching Programs (the 111 Project) (No. B07048); and the Program for New Century Excellent Talents in University (No. NCET-12-0920).

References

  1. Ali MM, Torn AA (2003) Population set-based global optimization algorithms: some modifications a numerical studies.  10.1016/S0305-0548(03)00116-3
  2. Andrews PS (2006) An investigation into mutation operators for particle swarm optimization. In: IEEE congress on evolutionary computation, Vancouver, pp 1044–1051Google Scholar
  3. Angeline PJ (1998) Using selection to improve particle swarm optimization. In: Proceedings of IEEE congress on evolutionary computation, Anchorage, pp 84–89Google Scholar
  4. Brits R, Engelbrecht AP, van den Bergh F (2002) A niching particle swarm optimizer. In: Proceedings of 4th Asia-Pacific conference on simulated evolution and learning (SEAL 2002), Singapore, pp 692–696Google Scholar
  5. Chen YP, Peng WC, Jian MC (2007) Particle swarm optimization with recombination and dynamic linkage discovery. IEEE Trans Syst Man Cybern B Cybern 37(6):1460–1470CrossRefGoogle Scholar
  6. Chen WN, Zhang J, Lin Y, Chen N, Zhan ZH, Chung HSH, Li Y, Shi YH (2013) Particle swarm optimization with an aging leader and challengers. IEEE Trans Evol Comput 17(2):241–258CrossRefGoogle Scholar
  7. Clerc M (1999) The swarm and the queen: Toward a deterministic and adaptive particle swarm optimization. In: Proceedings of IEEE congress on evolutionary computation, pp 1951–1957Google Scholar
  8. Clerc M, Kennedy J (2002) The particle swarm-explosion, stability and convergence in a multidimensional complex space. IEEE Trans Evol Comput 6(1):58–73CrossRefGoogle Scholar
  9. Deb K, Beyer HG (2001) Self-adaptive genetic algorithms with simulated binary crossover. Evol Comput 9(2):197–221CrossRefGoogle Scholar
  10. Higashi N, Iba H (2003) Particle swarm optimization with Gaussian mutation. In: IEEE swarm intelligence symposium, Indianapolis, pp 72–79Google Scholar
  11. Kennedy J (1999) Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance. In: Proceedings of IEEE congress on evolutionary computation, pp 1931–1938Google Scholar
  12. Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural network, vol 4. IEEE Press, Piscataway, pp 1942–1948Google Scholar
  13. Kennedy J, Mendes R (2002) Population structure and particle swarm performance. In: Proceedings of IEEE congress on evolutionary computation, Honolulu, pp 1671–1676Google Scholar
  14. Leungand YW, Wang Y (2001) An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans Evol Comput 5:41–53CrossRefGoogle Scholar
  15. Li X (2010) Niching without niching parameters: particle swarm optimization using a ring topology. IEEE Trans Evol Comput 14(1):150–169CrossRefGoogle Scholar
  16. Liang JJ, Qin AK, Suganthan PN, Baskar S (2006) Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans Evol Comput 10(3):281–295CrossRefGoogle Scholar
  17. Mendes R, Kennedy J, Neves J (2004) The fully informed particle swarm: simpler, maybe better. IEEE Trans Evol Comput 8:204–210CrossRefGoogle Scholar
  18. Montgomery DC (2000) Design and analysis of experiments, 5th edn. Wiley, New YorkGoogle Scholar
  19. Nasir M, Maity D, Das S, Sengupta S, Haldar U, Suganthan PN (2012) A dynamic neighborhood learning based particle swarm optimizer for global numerical optimization. Inf Sci 209:16–36CrossRefGoogle Scholar
  20. Pant M, Thangaraj R (2007) A new particle swarm optimization with quadratic crossover. In: International conference on advanced computing and communications (ADCOM ’07). IEEE Computer Society Press, India, pp 81–86Google Scholar
  21. Pant M, Ali M, Singh VP (2009) Differential evolution using quadratic interpolation for initializing the population. In: Proceedings of the 2009 IEEE international advance computing conference (IACC 2009), pp 375–380Google Scholar
  22. Parsopoulos KE, Vrahatis MN (2004) On the computation of all global minimizers through particle swarm optimization. IEEE Trans Evol Comput 8(3):211–224CrossRefMathSciNetGoogle Scholar
  23. Peram T, Veeramachaneni K, Mohan CK (2003) Fitness-distance-ratio based particle swarm optimization. In: Proceedings of swarm intelligence symposium, pp 174–181Google Scholar
  24. Qu BY, Suganthan PN, Das S (2013) A distance-based locally informed particle swarm model for multimodal optimization. IEEE Trans Evol Comput 17(3):387–402CrossRefGoogle Scholar
  25. Rahnamayan S, Tizhoosh HR, Salama MMA (2008) Opposition-based differential evolution. IEEE Trans Evol Comput 12(1):64–79CrossRefGoogle Scholar
  26. Ratnaweera A, Halgamuge SK, Watson HC (2004) Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Trans Evol Comput 8(3):240–255CrossRefGoogle Scholar
  27. Shi YH, Eberhart RC (1998) A modified particle swarm optimizer. In: Proceedings of IEEE world congress on computational intelligence, pp 69–73Google Scholar
  28. Suganthan PN (1999) Particle swarm optimizer with neighborhood operator. In: Proceedings of IEEE congress on evolutionary computation, Washington, pp 1958–1962Google Scholar
  29. Suganthan PN, Hansen N, Liang JJ, Deb K, Chen YP, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. In: Proceedings of IEEE congress on evolutionary computation, pp 1–50Google Scholar
  30. Tizhoosh HR (2005) Opposition-Based Learning: A New Scheme for Machine Intelligence. Int. Conf. on Computational Intelligence for Modeling Control and Automation-CIMCA 2005, Vienna, Austria, vol 1, pp 695-701Google Scholar
  31. Van den Bergh F, Engelbrecht AP (2004) A cooperative approach to particle swarm optimization. IEEE Trans Evol Comput 8(3):225–239CrossRefGoogle Scholar
  32. Yao X, Liu Y, Lin GM (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82–102CrossRefGoogle Scholar
  33. Zhan ZH, Xiao J, Zhang J, Chen WN (2007) Adaptive control of acceleration coefficients for particle swarm optimization based on clustering analysis. In: Proceedings of IEEE congress on evolutionary computation, Singapore, pp 3276–3282Google Scholar
  34. Zhan ZH, Zhang J, Li Y, Chung HSH (2009) Adaptive particle swarm optimization. IEEE Trans Syst Man Cybern Part B 39(6):1362–1381Google Scholar
  35. Zhan ZH, Zhang J, Li Y, Shi YH (2011) Orthogonal learning particle swarm optimization. IEEE Trans Evol Comput 15(6):832–847CrossRefGoogle Scholar
  36. 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–463CrossRefGoogle Scholar
  37. Zhang WJ, Xie XF (2003) DEPSO: Hybrid particle swarm with differential evolution operator. In: Proceedings of IEEE conference on systems, man, and cybernetics, pp 3816–3821Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  • Ruochen Liu
    • 1
  • Lixia Wang
    • 1
  • Wenping Ma
    • 1
  • Caihong Mu
    • 1
  • Licheng Jiao
    • 1
  1. 1.Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of ChinaXidian UniversityXi’anChina

Personalised recommendations