Center particle swarm optimization
Neurocomputing
Dispersed particle swarm optimization
Information Processing Letters
On the power of quantum computation
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Expert Systems with Applications: An International Journal
Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization
Computers and Operations Research
A study of particle swarm optimization particle trajectories
Information Sciences: an International Journal
Quantum-Behaved particle swarm optimization algorithm with controlled diversity
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
A global best artificial bee colony algorithm for global optimization
Journal of Computational and Applied Mathematics
Psychological model of particle swarm optimization based multiple emotions
Applied Intelligence
The particle swarm - explosion, stability, and convergence in amultidimensional complex space
IEEE Transactions on Evolutionary Computation
Accelerating Differential Evolution Using an Adaptive Local Search
IEEE Transactions on Evolutionary Computation
Parallel multi-swarm optimizer for gene selection in DNA microarrays
Applied Intelligence
LADPSO: using fuzzy logic to conduct PSO algorithm
Applied Intelligence
Dynamic clustering using combinatorial particle swarm optimization
Applied Intelligence
Cooperative particle swarm optimization for multiobjective transportation planning
Applied Intelligence
Hi-index | 0.00 |
In this paper, we propose some improvements that enhance the optimization ability of quantum-behaved particle swarm optimization algorithms. First, we propose an encoding approach based on qubits described on the Bloch sphere. In our approach, each particle contains three groups of Bloch coordinates of qubits, and all three groups of coordinates are regarded as approximate solutions describing the optimization result. Our approach updates the particles using the rotation of qubits about an axis on the Bloch sphere. This updating approach can simultaneously adjust two parameters of qubits, and can automatically achieve the best matching of two adjustments. To avoid premature convergence, the mutation is performed with Hadamard gates. The optimization process is performed in the n-dimensional hypercube space [驴1,1] n , so the proposed approach can be easily adapted to a variety of optimization problems. The experimental results show that the proposed algorithm is superior to the original one in optimization ability.