关键词: 量子计算, 进化算法, 旅行商问题

Abstract: Based on the analysis of the basic concepts of quantum evolution, a new Mixed Quantum-Inspired Evolutionary Algorithm for solving Traveling Salesman Problem（TSP） has been proposed, in which 3-Optimize local search heuristic was incorporated with quantum evolutionary mechanism, the nearest neighbor heuristic rule was used to initiate parameters, and the ordered crossover operator was introduced to extend the exploratory range of quantum population. Experiments were carried out on some cases from the well-known TSP library (TSPLIB). The results show that the new algorithm is effective and robust, which is able to find the satisfactory resolution with small size population and tiny relative error, even for medium or large scale problems (city number > 500). Key Words Quantum Computing; Evolutionary Algorithm; Traveling Salesman Problem.

Key words: quantum computing, evolutionary algorithm, Traveling Salesman Problem（TSP）