Analysis of Quantum-Inspired Evolutionary Algorithm

摘要

This paper extends the author's previous works on quantum-inspired evolutionary algorithm (QEA). It investigates the characteristics of QEA which is based on the concept and principles of quantum computing such as quantum bit and linear superposition of states. QEA has many advantages such as automatic balance ability between global search and local search, inclusion of individual's past history, having fewer individuals without degrading performance, less computation time, and clearer termination-condition. The experimental results on the knapsack problem are presented to verify these characteristics of QEA.