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
An Improved Quantum Evolutionary Algorithm with 2-Crossovers
ISNN '09 Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks
Hi-index | 0.00 |
Quantum Particle Swarm Optimization (QPSO) is a global convergence guaranteed search method which introduces the Quantum theory into the basic Particle Swarm Optimization (PSO) QPSO performs better than normal PSO on several benchmark problems However, QPSO's quantum bit(Qubit) is still in Hilbert space's unit circle with only one variable, so the quantum properties have been undermined to a large extent In this paper, the Bloch Sphere encoding mechanism is adopted into QPSO, which can vividly describe the dynamic behavior of the quantum In this way, the diversity of the swarm can be increased, and the local minima can be effectively avoided The proposed algorithm, named Bloch QPSO (BQPSO), is tested with PID controller parameters optimization problem Experimental results demonstrate that BQPSO has both stronger global search capability and faster convergence speed, and it is feasible and effective in solving some complex optimization problems.