Research on Particle Swarm Optimization Algorithm Based on Quantum Computing Technology
In view of the shortcomings of particle swarm optimization such as premature convergence to local optimization, particle swarm optimization algorithm based on quantum gate and particle swarm optimization algorithm based on quantum behavior are studied in this paper. The first algorithm uses the random observation method of quantum bit coding particles to simulate quantum particle collapse for generating a population and uses the quantum rotating gate to generate a new population. The adaptive mutation operator is used for ensuring the diversity of the population, effectively reducing the impact of local optimization; therefore, the robustness of the algorithm is improved. The second algorithm uses the probability density function of quantum computation to make the particles jump out of the local extreme points and fulfils the global search, which is more suitable for continuous optimization. The results of computational experiments show that both the two particle swarm optimization algorithms based on quantum technology have a good global convergence.