Quantum behaved particle swarm optimization with neighborhood search for numerical optimization. (English) Zbl 1299.90394
Summary: Quantum-behaved particle swarm optimization (QPSO) algorithm is a new PSO variant, which outperforms the original PSO in search ability but has fewer control parameters. However, QPSO as well as PSO still suffers from premature convergence in solving complex optimization problems. The main reason is that new particles in QPSO are generated around the weighted attractors of previous best particles and the global best particle. This may result in attracting too fast. To tackle this problem, this paper proposes a new QPSO algorithm called NQPSO, in which one local and one global neighborhood search strategies are utilized to balance exploitation and exploration. Moreover, a concept of opposition-based learning (OBL) is employed for population initialization. Experimental studies are conducted on a set of well-known benchmark functions including multimodal and rotated problems. Computational results show that our approach outperforms some similar QPSO algorithms and five other state-of-the-art PSO variants.
MSC:
| 90C59 | Approximation methods and heuristics in mathematical programming |
| 81P99 | Foundations, quantum information and its processing, quantum axioms, and philosophy |
References:
| [1] | D. E. Goldberg, Genetic Algorithms in Search Optimization and Machine Learning, Addison-Wesley, Reading, Mass, USA, 1989. · Zbl 0721.68056 |
| [2] | L. J. Fogel, “Evolutionary programming in perspective: the top-down view,” in Computational Intelligence: Imitating Life, IEEE Press, Piscataway, NJ, USA, 1994. |
| [3] | J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the 1995 IEEE International Conference on Neural Networks, pp. 1942-1948, December 1995. |
| [4] | K. V. Price, R. M. Storn, and J. A. Lampinen, Differential Evolution: A Practical Approach to Global Optimization, Natural Computing Series, Springer, Berlin, Germany, 1st edition, 2005. · Zbl 1186.90004 |
| [5] | M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics B, vol. 26, no. 1, pp. 29-41, 1996. · doi:10.1109/3477.484436 |
| [6] | D. Karaboga, “An idea based on honey bee swarm for numerical optimization,” Tech. Rep. TR06, Erciyes University, Engineering Faculty, Computer Engineering Department, 2005. |
| [7] | L. Ali, S. L. Sabat, and S. K. Udgata, “Particle swarm optimisation with stochastic ranking for constrained numerical and engineering benchmark problems,” International Journal of Bio-Inspired Computation, vol. 4, no. 3, pp. 155-166, 2012. · doi:10.1504/IJBIC.2012.047238 |
| [8] | C. C. Tseng, J. G. Hsieh, and J. H. Jeng, “Active contour model via multi-population particle swarm optimization,” Expert Systems with Applications, vol. 36, no. 3, pp. 5348-5352, 2009. · doi:10.1016/j.eswa.2008.06.114 |
| [9] | K. W. Yu and Z. L. Huang, “LQ regulator design based on particle swarm optimization,” in Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, pp. 4142-4145, Taipei, Taiwan, October 2006. · doi:10.1109/ICSMC.2006.384783 |
| [10] | C. Priya and P. Lakshmi, “Particle swarm optimisation applied to real time control of spherical tank system,” International Journal of Bio-Inspired Computation, vol. 4, no. 4, pp. 206-216, 2012. · doi:10.1504/IJBIC.2012.048065 |
| [11] | H. Wang, “Opposition-based barebones particle swarm for constrained nonlinear optimization problems,” Mathematical Problems in Engineering, vol. 2012, Article ID 761708, 12 pages, 2012. · Zbl 1264.90190 · doi:10.1155/2012/761708 |
| [12] | Y. Shi and R. Eberhart, “Modified particle swarm optimizer,” in Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC ’98), pp. 69-73, May 1998. |
| [13] | F. van den Bergh and A. P. Engelbrecht, “A cooperative approach to participle swam optimization,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 3, pp. 225-239, 2004. · doi:10.1109/TEVC.2004.826069 |
| [14] | J. J. Liang, A. K. Qin, P. N. Suganthan, and S. Baskar, “Comprehensive learning particle swarm optimizer for global optimization of multimodal functions,” IEEE Transactions on Evolutionary Computation, vol. 10, no. 3, pp. 281-295, 2006. · doi:10.1109/TEVC.2005.857610 |
| [15] | C. Li, S. Yang, and T. T. Nguyen, “A self-learning particle swarm optimizer for global optimization problems,” IEEE Transactions on Systems, Man, and Cybernetics B, vol. 42, no. 3, pp. 627-646, 2012. · doi:10.1109/TSMCB.2011.2171946 |
| [16] | Z. H. Zhan, J. Zhang, Y. Li, and H. S. H. Chung, “Adaptive particle swarm optimization,” IEEE Transactions on Systems, Man, and Cybernetics B, vol. 39, no. 6, pp. 1362-1381, 2009. · doi:10.1109/TSMCB.2009.2015956 |
| [17] | H. Wang, Z. J. Wu, S. Rahnamayan, Y. Liu, and M. Ventresca, “Enhancing particle swarm optimization using generalized opposition-based learning,” Information Sciences, vol. 181, no. 20, pp. 4699-4714, 2011. · doi:10.1016/j.ins.2011.03.016 |
| [18] | H. Tizhoosh, “Opposition-based reinforcement learning,” Journal of Advanced Computational Intelligence and Intelligent Informatics, vol. 10, no. 4, pp. 578-585, 2006. |
| [19] | H. Wang, H. Sun, C. Li, S. Rahnamayan, and J. Pan, “Diversity enhanced particle swarm optimization with neighborhood search,” Information Sciences, vol. 223, pp. 119-135, 2013. · doi:10.1016/j.ins.2012.10.012 |
| [20] | J. Sun, B. Feng, and W. B. Xu, “Particle swarm optimization with particles having quantum behavior,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC ’04), pp. 325-331, June 2004. |
| [21] | J. Sun, W. B. Xu, and W. Fang, “A diversity-guided quantum-behaved particle swarm optimization algorithm,” in Simulated Evolution and Learning, vol. 4247 of Lecture Notes in Computer Science, pp. 497-504, Springer, New York, NY, USA, 2006. · Zbl 1157.68433 |
| [22] | K. Yang and H. Nomura, “Quantum-behaved particle swarm optimization with chaotic search,” IEICE Transactions on Information and Systems, vol. 91, no. 7, pp. 1963-1970, 2008. · doi:10.1093/ietisy/e91-d.7.1963 |
| [23] | W. Zhao, Y. San, and H. Shi, “Fuzzy quantum-behaved particle swarm optimization algorithm,” in Proceedings of the International Symposium on Computational Intelligence and Design (ISCID ’10), pp. 49-52, Hangzhou, China, October 2010. · doi:10.1109/ISCID.2010.20 |
| [24] | J. Wang and Y. Zhou, “Quantum-behaved particle swarm optimization with generalized local search operator for global optimization,” in Advanced Intelligent Computing Theories and Applications: With Aspects of Artificial Intelligence, vol. 4682 of Lecture Notes in Computer Science, pp. 851-860, Springer, New York, NY, USA, 2007. |
| [25] | F. van den Bergh and A. P. Engelbrecht, “A study of particle swarm optimization particle trajectories,” Information Sciences, vol. 176, no. 8, pp. 937-971, 2006. · Zbl 1093.68105 · doi:10.1016/j.ins.2005.02.003 |
| [26] | M. Jamalipour, R. Sayareh, M. Gharib, F. Khoshahval, and M. R. Karimi, “Quantum behaved particle swarm optimization with differential mutation operator applied to WWER-1000 in-core fuel management optimization,” Annals of Nuclear Energy, vol. 54, pp. 134-140, 2013. · doi:10.1016/j.anucene.2012.11.008 |
| [27] | S. Rahnamayan, H. R. Tizhoosh, and M. M. A. Salama, “A novel population initialization method for accelerating evolutionary algorithms,” Computers and Mathematics with Applications, vol. 53, no. 10, pp. 1605-1614, 2007. · Zbl 1152.90672 · doi:10.1016/j.camwa.2006.07.013 |
| [28] | M. Xi, J. Sun, and W. Xu, “An improved quantum-behaved particle swarm optimization algorithm with weighted mean best position,” Applied Mathematics and Computation, vol. 205, no. 2, pp. 751-759, 2008. · Zbl 1157.65395 · doi:10.1016/j.amc.2008.05.135 |
| [29] | W. Wang, H. Wang, and S. Rahnamayan, “Improving comprehensive learning particle swarm optimiser using generalised opposition-based learning,” International Journal of Modelling, Identification and Control, vol. 14, no. 4, pp. 310-316, 2011. · doi:10.1504/IJMIC.2011.043155 |
| [30] | H. Wang, S. Rahnamayan, H. Sun, and M. G. H. Omran, “Gaussian bare-bones differential evolution,” IEEE Transactions on Cybernetics, vol. 43, no. 2, pp. 634-647, 2013. · doi:10.1109/TSMCB.2012.2213808 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
