Adaptive parameter selection of quantum-behaved particle swarm optimization on global level

Authors:
Wenbo Xu;Jun Sun
Affiliations:
School of Information Technology, Southern Yangtze University, Wuxi, Jiangsu, China;School of Information Technology, Southern Yangtze University, Wuxi, Jiangsu, China
Venue:
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part I
Year:
2005

Citing 6
Cited 1

Diversity-Guided Evolutionary Algorithms

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Comparison between Genetic Algorithms and Particle Swarm Optimization

EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences

EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Particle swarm optimisation with spatial particle extension

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Division of labor in particle swarm optimisation

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
The particle swarm - explosion, stability, and convergence in amultidimensional complex space

IEEE Transactions on Evolutionary Computation

Quantum-Behaved Particle Swarm Optimization with Generalized Local Search Operator for Global Optimization

ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we formulate the philosophy of Quantum-behaved Particle Swarm Optimization (QPSO) Algorithm, and suggest a parameter control method based on the population level. After that, we introduce a diversity-guided model into the QPSO to make the PSO system an open evolutionary particle swarm and therefore propose the Adaptive Quantum-behaved Particle Swarm Optimization Algorithm (AQPSO). Finally, the performance of AQPSO algorithm is compared with those of Standard PSO (SPSO) and original QPSO by testing the algorithms on several benchmark functions. The experiments results show that AQPSO algorithm outperforms due to its strong global search ability, particularly in the optimization problems with high dimension.