Skip to main content
SpringerLink
Log in

Quadratic interpolation based orthogonal learning particle swarm optimization algorithm

  • Published:
Natural Computing Aims and scope Submit manuscript

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.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Ali MM, Torn AA (2003) Population set-based global optimization algorithms: some modifications a numerical studies. 10.1016/S0305-0548(03)00116-3

  • Andrews PS (2006) An investigation into mutation operators for particle swarm optimization. In: IEEE congress on evolutionary computation, Vancouver, pp 1044–1051

  • Angeline PJ (1998) Using selection to improve particle swarm optimization. In: Proceedings of IEEE congress on evolutionary computation, Anchorage, pp 84–89

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

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

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

    Article  Google Scholar 

  • Deb K, Beyer HG (2001) Self-adaptive genetic algorithms with simulated binary crossover. Evol Comput 9(2):197–221

    Article  Google Scholar 

  • Higashi N, Iba H (2003) Particle swarm optimization with Gaussian mutation. In: IEEE swarm intelligence symposium, Indianapolis, pp 72–79

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

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

  • Kennedy J, Mendes R (2002) Population structure and particle swarm performance. In: Proceedings of IEEE congress on evolutionary computation, Honolulu, pp 1671–1676

  • Leungand YW, Wang Y (2001) An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans Evol Comput 5:41–53

    Article  Google Scholar 

  • Li X (2010) Niching without niching parameters: particle swarm optimization using a ring topology. IEEE Trans Evol Comput 14(1):150–169

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Montgomery DC (2000) Design and analysis of experiments, 5th edn. Wiley, New York

    Google Scholar 

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

    Article  Google Scholar 

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

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

  • Parsopoulos KE, Vrahatis MN (2004) On the computation of all global minimizers through particle swarm optimization. IEEE Trans Evol Comput 8(3):211–224

    Article  MathSciNet  Google Scholar 

  • Peram T, Veeramachaneni K, Mohan CK (2003) Fitness-distance-ratio based particle swarm optimization. In: Proceedings of swarm intelligence symposium, pp 174–181

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

    Article  Google Scholar 

  • Rahnamayan S, Tizhoosh HR, Salama MMA (2008) Opposition-based differential evolution. IEEE Trans Evol Comput 12(1):64–79

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Shi YH, Eberhart RC (1998) A modified particle swarm optimizer. In: Proceedings of IEEE world congress on computational intelligence, pp 69–73

  • Suganthan PN (1999) Particle swarm optimizer with neighborhood operator. In: Proceedings of IEEE congress on evolutionary computation, Washington, pp 1958–1962

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

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

  • Van den Bergh F, Engelbrecht AP (2004) A cooperative approach to particle swarm optimization. IEEE Trans Evol Comput 8(3):225–239

    Article  Google Scholar 

  • Yao X, Liu Y, Lin GM (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82–102

    Article  Google Scholar 

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

  • Zhan ZH, Zhang J, Li Y, Chung HSH (2009) Adaptive particle swarm optimization. IEEE Trans Syst Man Cybern Part B 39(6):1362–1381

    Google Scholar 

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

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

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

Download references

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).

Author information

Authors and Affiliations

  1. Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China, Xidian University, Xi’an, 710071, China

    Ruochen Liu, Lixia Wang, Wenping Ma, Caihong Mu & Licheng Jiao

Authors
  1. Ruochen Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lixia Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wenping Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Caihong Mu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Licheng Jiao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ruochen Liu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, R., Wang, L., Ma, W. et al. Quadratic interpolation based orthogonal learning particle swarm optimization algorithm. Nat Comput 13, 17–37 (2014). https://doi.org/10.1007/s11047-013-9408-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-013-9408-3

Keywords

Search

Navigation