An Improved Immune Algorithm for Solving TSP Problem

Immune algorithm is a set of computational systems inspired by the defense process of the biological immune system, and is widespread used in the combinatorial optimization problems. This paper describes an improved immune algorithm to solve the combinatorial optimization problems. The TSP problem is a typical application of the combinatorial optimization problems. The improved immune algorithm which based on the quantum principles is proposed for finding the optimal solutions to solve the TSP problem. In process of solving TSP problem, the quantum concept is used in initializing a population of quantum bit chromosomes. In the antibody's updating, the general quantum rotation gate strategy and the dynamic adjusting angle mechanism are applied to accelerate convergence.According to the analysis of the experiment, the algorithm is not only feasible but also effective to solve TSP problem. It effectively relieves some disadvantages of the quantum and immune optimization.