Advertisement

Neural Computing and Applications

, Volume 27, Issue 8, pp 2429–2440 | Cite as

A two-stage quantum-behaved particle swarm optimization with skipping search rule and weight to solve continuous optimization problem

  • Deyu Tang
  • Shoubin Dong
  • Xianfa Cai
  • Jie Zhao
Original Article

Abstract

Quantum-behaved particle swarm optimization (QPSO) is a recently developed heuristic method by particle swarm optimization (PSO) algorithm based on quantum mechanics, which outperforms the search ability of original PSO. But as many other PSOs, it is easy to fall into the local optima for the complex optimization problems. Therefore, we propose a two-stage quantum-behaved particle swarm optimization with a skipping search rule and a mean attractor with weight. The first stage uses quantum mechanism, and the second stage uses the particle swarm evolution method. It is shown that the improved QPSO has better performance, because of discarding the worst particles and enhancing the diversity of the population. The proposed algorithm (called ‘TSQPSO’) is tested on several benchmark functions and some real-world optimization problems and then compared with the PSO, SFLA, RQPSO and WQPSO and many other heuristic algorithms. The experiment results show that our algorithm has better performance than others.

Keywords

Particle swarm optimization Quantum behavior Two-stage search strategy Skipping search rule Weighted mean best position 

Notes

Acknowledgments

This work was supported by NSFC, research on reasoning of behavior trust for resisting collusive reputation attack (71401045); the National Natural Science Foundation Project (No. 61070092/F020504); the building of strong Guangdong Province for Chinese medicine scientific research(20141165); the Humanities and social science fund project for Guangdong Pharmaceutical University (RWSK201409); GuangDong Provincial Natural fund (2014A030313585), Ukraine Senate Xingnao neuroprotective effect mechanism of dynamic network based on network pharmacology; Guangdong Province Youth Innovation Talent Project, based on the cognitive rules of the semi-supervised key algorithm and its cancer pattern recognition (2014KQNCX139); 2014 annual training program of outstanding young teachers in Higher Education in Guangdong Province; Guangdong Science & Technology Projects (2013B090500087/2014B010112006).

References

  1. 1.
    Cui ZH, Zeng JC, Sun GJ (2006) Adaptive velocity threshold particle swarm optimization. Lect Notes Artific Intell 4062:327–332zbMATHGoogle Scholar
  2. 2.
    Shi Y, Eberhart RC (2001) Fuzzy adaptive particle swarm optimization. In: Proceedings of the congress on evolutionary computation. Piscataway: IEEE, pp 101–106Google Scholar
  3. 3.
    Clerc M (1999) The swarm and the queen: Towards a deterministic and adaptive particle swarm optimization. In: Proceedings of the ICEC. Washington, pp 1951–1957Google Scholar
  4. 4.
    Gang M, Wei Z, Xiaolin C (2012) A novel particle swarm optimization algorithm based on particle migration. Appl Math Comput 218:6620–6626MathSciNetzbMATHGoogle Scholar
  5. 5.
    Eusuff M, Lansey K (2003) Optimization of water distribution network design using the shuffled frog leaping algorithm. J Water Resour Plan Manag 129:10–25CrossRefGoogle Scholar
  6. 6.
    Sun J, Feng B, Xu W (2004) Particle swarm optimization with particles having quantum behavior. In: IEEE Congress on Evolutionary Computation, pp 325–331Google Scholar
  7. 7.
    Sun J, Feng B, XU W (2004) A global search strategy of quantum-behaved particle swarm optimization. In: IEEE Conference on cybernetics and intelligent systems, pp 111–116Google Scholar
  8. 8.
    Sun J, Chen W, Fang W, Wun X, Xu W (2012) Gene expression data analysis with the clustering method based on an improved quantum-behaved Particle Swarm Optimization. Eng Appl Artif Intell 25:376–391CrossRefGoogle Scholar
  9. 9.
    Sun J, Fang W, Wu X, Wie Z, Xu W (2011) QoS multicast routing using a quantum-behaved particle swarm optimization algorithm. Eng Appl Artif Intell 24:123–131CrossRefGoogle Scholar
  10. 10.
    Zhao J, Sun J, Xu W (2009) Application of online system identification based on improved quantumbehaved particle swarm optimization. In: Second international symposium on computational intelligence and design, vol 2, pp 186–189Google Scholar
  11. 11.
    Sun J, Xiaojun W, Fang W, Ding Y, Long H, Webo X (2012) Multiple sequence alignment using the Hidden Markov Model trained by an improved quantum-behaved particle swarm optimization. Inf Sci 182:93–114MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Jing L, Wenbo X, Jun S (2005) Quantum-behaved particle swarm optimization with mutation operator. In: 2005 ICTAI 05. 17th IEEE international conference, pp 236–240Google Scholar
  13. 13.
    Liu J, Sun J, Xu WB (2006) Quantum-behaved particle swarm optimization with adaptive mutation operator. Adv Natl Comput 4221:959–967CrossRefGoogle Scholar
  14. 14.
    Sun J, Fang W, Palade V, Wua X, Xu W (2011) Quantum-behaved particle swarm optimization with Gaussian distributed local attractor point. Appl Math Comput 218:3763–3775zbMATHGoogle Scholar
  15. 15.
    Xi M, Sun J, Xu W (2008) An improved quantum-behaved particle swarm optimization algorithm with weighted mean best position. Appl Math Comput 205:751–759zbMATHGoogle Scholar
  16. 16.
    Sun J, Wua X, Palade V, Fang W, Lai C-H, Wenbo X (2012) Convergence analysis and improvements of quantum-behaved particle swarm optimization. Inf Sci 193:81–103MathSciNetCrossRefGoogle Scholar
  17. 17.
    Yang J, Xie J (2010) An improved quantum-behaved particle swarm optimization algorithm, 2010. In: 2nd International Asia conference on informatics in control, automation and robotics, pp 159–162Google Scholar
  18. 18.
    Lin H, Maolong X, Yanghua Z (2010) An improved quantum-behaved particle swarm optimization with random selection of the optimal individual. In: WASE International conference on information engineering vol 4, pp 189–193Google Scholar
  19. 19.
    Li Y, Xiang R, Jiao L, Liu R (2012) An improved cooperative quantum-behaved particle swarm optimization. Soft Comput 16:1061–1069CrossRefGoogle Scholar
  20. 20.
    Wei F, Jun S, Wenbo X (2009) Analysis of mutation operators on quantum-behaved particle swarm optimization algorithm. In: New mathematics and natural computation (NMNC), pp 5487–5496Google Scholar
  21. 21.
    Tang DY, Cai YM, Zhao J, Xue Y (2014) A quantum-behaved particle swarm optimization with memetic algorithm and memory for continuous non-linear large scale problems. Inf Sci 289:162–189CrossRefGoogle Scholar
  22. 22.
    Chi YH, Wang FC (2011) An improved particle swarm optimization algorithm with search space zoomed factor and attractor. Chin J Compte 34:115–130CrossRefGoogle Scholar
  23. 23.
    Huang H, Qin H, Hao Z, Lim A (2012) Example-based learning particle swarm optimization for continuous optimization. Inf Sci 182:125–138MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Wang HU, Zhi-Shu LI (2007) A simpler and more effective particle swarm optimization algorithm. J Softw 18:861–869CrossRefzbMATHGoogle Scholar
  25. 25.
    Derrac J, García S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1:3–18CrossRefGoogle Scholar
  26. 26.
    Arora JS (1989) Introduction to optimum design. McGraw-Hill, New YorkGoogle Scholar
  27. 27.
    Kannan BK, Kramer SN (1994) An augmented lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design. J Mech Des 116:405–411CrossRefGoogle Scholar
  28. 28.
    Coello CAC (2000) Use of a self-adaptive penalty approach for engineering optimization problems. Comput Ind 41:113–127CrossRefGoogle Scholar
  29. 29.
    Sadollah A, Bahreininejad A, Eskandar H, Hamdi M (2013) Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems. Appl Soft Comput 13:2592–2612CrossRefGoogle Scholar
  30. 30.
    Mezura-Montes E, Coello CAC (2005) Useful infeasible solutions in engineering optimization with evolutionary algorithms. In: MICAI 2005: lecture notes on artificial intelligence, vol 3789, pp 652–662Google Scholar
  31. 31.
    Parsopoulos K, Vrahatis M (2005) Unified particle swarm optimization for solving constrained engineering optimization problems. In: Advances in natural computation, vol 3612. Springer, Berlin, pp 582–591Google Scholar

Copyright information

© The Natural Computing Applications Forum 2015

Authors and Affiliations

  • Deyu Tang
    • 1
    • 2
  • Shoubin Dong
    • 2
  • Xianfa Cai
    • 1
  • Jie Zhao
    • 3
  1. 1.School of Medical Information and EngineeringGuangDong Pharmaceutical UniversityGuangzhouChina
  2. 2.School of Computer Science & EngineeringSouth China University of TechnologyGuangzhouChina
  3. 3.Department of information Management Engineering, School of ManagementGuangdong University of TechnologyGuangzhouChina

Personalised recommendations