Quantum-Inspired Genetic Algorithm Based on Simulated Annealing for Combinatorial Optimization Problem

Abstract

Quantum-inspired genetic algorithm (QGA) is applied to simulated annealing (SA) to develop a class of quantum-inspired simulated annealing genetic algorithm (QSAGA) for combinatorial optimization. With the condition of preserving QGA advantages, QSAGA takes advantage of the SA algorithm so as to avoid premature convergence. To demonstrate its effectiveness and applicability, experiments are carried out on the knapsack problem. The results show that QSAGA performs well, without premature convergence as compared to QGA.

Keywords:

• Quantum computing
• Knapsack problem