A two-stage quantum-behaved particle swarm optimization with skipping search rule and weight to solve continuous optimization problem
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.
KeywordsParticle swarm optimization Quantum behavior Two-stage search strategy Skipping search rule Weighted mean best position
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).
- 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.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
- 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.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
- 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
- 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
- 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.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
- 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
- 26.Arora JS (1989) Introduction to optimum design. McGraw-Hill, New YorkGoogle Scholar
- 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.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