Abstract: To enhance the efficiency of artificial immune algorithms for Traveling Salesman Problem (TSP), we designed a dynamic vaccination strategy. The proposed vaccination obtains both single-vaccines and multi-vaccines by applying a linear complex intersecting operation on a random subset of the memory cell. The lengths of vaccines increase with iteration, which depresses the problem size and algorithm’s searching space. Compared with other vaccination strategies, the proposed strategy is unsupervised, which makes more accurate prediction of edges in the best tour and helps immune algorithms to maintain better solution paths.

Key words: artificial immune, traveling salesman problem, vaccination, clonal selection