Chaos updating rotated gates quantum-inspired genetic algorithm

Abstract

From the recent research on combinational optimization of the knapsack problem, the quantum-inspired genetic algorithm (QGA) was proved to be better than conventional genetic algorithms. To accelerate the convergence speed of the QGA, the paper proposes research issues on QGA such as Q-gate. A novel Q-gate updating algorithm called chaos updating rotated gates quantum-inspired genetic algorithm (CQGA) is proposed. An analysis of the two main characters of quantum computing and chaos is also presented. This algorithm demonstrates the convergence of the quantum genetic algorithm (QGA). Several experiments are carried out on a class of numerical and combinatorial optimization problems. The results show the updated QGA makes QGA more powerful than the previous QGA in convergence speed.