A Cooperative Approach to Quantum-behaved Particle Swarm Optimization

Abstract

An advanced Quantum-Particle algorithm is presented to improve the problem of the curse of dimensionality. The Quantum-Particle algorithm which has high-dimensional problem uses multiple swarms to optimize different components of the solution vector by cooperative-method and help the algorithm break away from the curse of dimensionality to find the global optimal solution The experimental results of classic functions show that the improved hybrid method keep the balance between the global search and local search Furthermore, the enhanced algorithm has great advantage of robustness compared to PSO and QPSO algorithm.