A Combined Swarm Differential Evolution Algorithm for Optimization Problems
Proceedings of the 14th International conference on Industrial and engineering applications of artificial intelligence and expert systems: engineering of intelligent systems
Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences
EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Quantum-Behaved Particle Swarm Optimization with Mutation Operator
ICTAI '05 Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence
Don't push me! Collision-avoiding swarms
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Extending particle swarm optimisers with self-organized criticality
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Introducing dynamic diversity into a discrete particle swarm optimization
Computers and Operations Research
Quantum-behaved particle swarm optimization with a hybrid probability distribution
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Quantum-Behaved particle swarm optimization with immune operator
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
A diversity-guided quantum-behaved particle swarm optimization algorithm
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Evolutionary programming made faster
IEEE Transactions on Evolutionary Computation
The particle swarm - explosion, stability, and convergence in amultidimensional complex space
IEEE Transactions on Evolutionary Computation
On the computation of all global minimizers through particle swarm optimization
IEEE Transactions on Evolutionary Computation
A Cooperative approach to particle swarm optimization
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
Quantum-behaved particle swarm optimisation (QPSO) algorithm is a global convergence guaranteed algorithms, which outperforms original PSO in search ability but has fewer parameters to control. This paper describes two selection mechanisms into QPSO to improve the search ability of QPSO. One is the QPSO with tournament selection (QPSO-TS) and the other is the QPSO with roulette-wheel selection (QPSO-RS). While the centre of position distribution of each particle in QPSO is determined by global best position and personal best position, in the QPSO with selection operation, the global best position is substituted by a candidate solution through selection. The QPSO with selection operation also maintains the mean best position of the swarm as in the previous QPSO to make the swarm more efficient in global search. The experiment results on benchmark functions show that both QPSO-RS and QPSO-TS have better performance and stronger global search ability than QPSO and standard PSO.