An Improved Immune-Genetic Algorithm for the Traveling Salesman Problem

An improved immune-genetic algorithm is applied to solve the traveling salesman problem (TSP) in this paper. A new selection strategy is incorporated into the conventional genetic algorithm to improve the performance of genetic algorithm. The selection strategy includes three computational procedures: evaluating the diversity of genes, calculating the percentage of genes, and computing the selection probability of genes. Computer numerical experiments on two case studies (21-city and 56-city TSPs) are performed to validate the effectiveness of the improved immune-genetic algorithm. The results show that by incorporating inoculating genes into conventional procedures of genetic algorithm, the number of evolutional iterations to reach an optimal solution can be significantly reduced.

[1]  Licheng Jiao,et al.  A novel genetic algorithim based on immunity , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[2]  Yu Jian-kun.  Genetic Algorithm and Its Application , 2002 .

[3]  Claude-Nicolas Fiechter,et al.  A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems , 1994, Discret. Appl. Math..

[4]  H. P. Stehouwer,et al.  Neural Networks and the Travelling Salesman Problem , 1993 .

[5]  Licheng Jiao,et al.  A novel genetic algorithm based on immunity , 2000, IEEE Trans. Syst. Man Cybern. Part A.

[6]  B.-K. Choi,et al.  Multiobjective Optimum Design of Rotor-Bearing Systems With Dynamic Constraints Using Immune-Genetic Algorithm , 2001 .

[7]  R. Bixby,et al.  On the Solution of Traveling Salesman Problems , 1998 .

[8]  P. V. Laarhoven,et al.  A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem , 1988 .

[9]  Bo-Suk Yang,et al.  Optimal Design of Rotor-Bearing Systems Using Immune-Genetic Algorithm , 2001 .

[10]  Jyh-Da Wei,et al.  A new approach to the traveling salesman problem using genetic algorithms with priority encoding , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[11]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[12]  Yang Xiu-xia.  New immune genetic algorithm and its application on TSP , 2005 .

[13]  George L. Nemhauser,et al.  Flight String Models for Aircraft Fleeting and Routing , 1998, Transp. Sci..

[14]  Licheng Jiao,et al.  Immune algorithm for KDD , 2001, International Symposium on Multispectral Image Processing and Pattern Recognition.

[15]  Kwong-Sak Leung,et al.  An efficient self-organizing map designed by genetic algorithms for the traveling salesman problem , 2003, IEEE Trans. Syst. Man Cybern. Part B.

[16]  Jean-Yves Potvin,et al.  Genetic Algorithms for the Traveling Salesman Problem , 2005 .

[17]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[18]  Timothy J. Lowe,et al.  The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic , 1987, Oper. Res..

[19]  Bin Wu,et al.  An improved strategy for GAs in structural optimization , 1996 .

[20]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .