zbMATH — the first resource for mathematics

An improved quantum-behaved particle swarm optimization algorithm with weighted mean best position. (English) Zbl 1157.65395
Summary: Quantum-behaved particle swarm optimization (QPSO) algorithm is a global convergence algorithm, which outperforms the original PSO in search ability but has fewer parameters to control. In this paper, we propose an improved quantum-behaved particle swarm optimization with weighted mean best position according to the fitness values of the particles. It is shown that the improved QPSO has faster local convergence speed, resulting in better balance between the global and local searching of the algorithm, and thus generating good performance. The proposed improved QPSO, called weighted QPSO (WQPSO) algorithm, is tested on several benchmark functions and compared with QPSO and standard PSO. The experiment results show the superiority of WQPSO.

65K05 Numerical mathematical programming methods
90C15 Stochastic programming
Full Text: DOI
[1] Goldberg, D.E., Genetic algorithms in search optimization and machine learning, (1989), Addison-Wesley Reading, MA · Zbl 0721.68056
[2] Fogel, L.J., Evolutionary programming in perspective: the top – down view, ()
[3] Rechenberg, I., Evolution strategy, () · Zbl 0537.92015
[4] Koza, J.R., Genetic programming: on the programming of computers by means of natural selection, (1992), MIT Press Cambridge, MA · Zbl 0850.68161
[5] J. Kennedy, R. Eberhart, Particle swarm optimization, in: Proceedings of IEEE International Conference On Neural Network, 1995, pp. 1942-1948.
[6] Y.L. Zheng, L.H. Ma, L.Y. Zhang, Empirical study of particle swarm optimizer with an increasing inertia weight, in: Proceedings of IEEE Congress on Evolutionary Computation 2003 (CEC 2003), Canbella, Australia, 2003, pp. 221-226.
[7] Clerc, M., Discrete particle swarm optimization, new optimization techniques in engineering, (2004), Springer Verlag
[8] F. Van den Bergh, An Analysis of Particle Swarm Optimizers, Ph.D. Thesis, University of Pretoria, November 2001.
[9] J. Sun, B. Feng, W.B. Xu, Particle swarm optimization with particles having quantum behavior, in: IEEE Proceedings of Congress on Evolutionary Computation, 2004, pp. 325-331.
[10] J. Sun, W.B. Xu, B. Feng, a global search strategy of quantum-behaved particle swarm optimization, in: Cybernetics and Intelligent Systems Proceedings of the 2004 IEEE Conference, 2004, pp. 111-116.
[11] J. Sun, W.B. Xu, B. Feng, Adaptive parameter control for quantum-behaved particle swarm optimization on individual level, in: IEEE International Conference on Systems, Man and Cybernetics, 2005, pp. 3049-3054.
[12] Y. Shi, R. Eberhart, Empirical study of particle swarm optimization, in: Proceedings of Congress on Evolutionary Computation, Piscataway, NJ, 1999, pp. 1945-1950.
[13] Y. Shi, R.C. Eberhart, A modified particle swarm. in: Proceedings, IEEE International Conference on Evolutionary Computation, Piscataway, NJ, 1998, pp. 69-73.
[14] M. Clerc, J. Kennedy, The particle swarm: explosion, stability, and convergence in a multi-dimensional complex space, in: IEEE Transactions on Evolutionary Computation 6(1). Piscataway, NJ, 2002, pp. 58-73.
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.