This paper presents a modified quantum-inspired particle swarm optimization algorithm (MQPSO) which uses particle swarm optimization algorithm to update quantum coding. The introduction of quantum coding can improve the diversity of algorithm, but may mislead the global search simultaneously. To remedy this drawback, a novel repair operator is developed to improve the search accuracy and efficiency of algorithm. The performance of MQPSO is evaluated and compared with quantum-inspired evolutionary algorithm (QEA), QEA with NOT gate (QEAN) and quantum swarm evolutionary algorithm (QSE) on 0-1knapsack problem and multidimensional knapsack problem. The experimental results demonstrate that the presented repair operator can effectively improve the global search ability of algorithm and MQPSO outperforms QEA, QEAN and QSE on all test benchmark problems in terms of search accuracy and convergence speed. © 2011 Springer-Verlag.
CITATION STYLE
Wang, L., Zhang, M., Niu, Q., & Yao, J. (2011). A modified quantum-inspired particle swarm optimization algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7004 LNAI, pp. 412–419). https://doi.org/10.1007/978-3-642-23896-3_51
Mendeley helps you to discover research relevant for your work.