Abstract
The purpose of this paper is to generalize Quantum-behaved Particle Swarm Optimization (QPSO) Algorithm to discrete binary search space. To design Binary QPSO (BQPSO), we redefine the position vector and the distance between two positions, and adjust the iterative equations of QPSO to binary search space. The operations designed for BQPSO are far different from those in BPSO, but somewhat like those in Genetic Algorithms (GAs). Therefore, BQPSO integrates strongpoint of GA with the features of PSO, which make it able to find out the global optimum of the problem more efficiently than BPSO, as shown by the experiment results of BQPSO and BPSO on De Jong's five test functions. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Sun, J., Xu, W., Fang, W., & Chai, Z. (2007). Quantum-behaved particle swarm optimization with binary encoding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4431 LNCS, pp. 376–385). Springer Verlag. https://doi.org/10.1007/978-3-540-71618-1_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
