An improved immune-genetic algorithm for the traveling salesman problem

Proceedings - Third International Conference on Natural Computation, ICNC 2007

Volumn 4, Issue , 2007, Pages 297-301

  Lu, Jingui ^a   Fang, Ning ^b   Shao, Dinghong ^a   Liu, Congyan ^a  

^a NANJING TECH UNIVERSITY   (China)

^b UTAH STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; IMMUNOLOGY; PROBABILITY; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

EVOLUTIONAL ITERATIONS; IMMUNE-GENETIC ALGORITHMS; SELECTION PROBABILITY;

GENETIC ALGORITHMS;

EID: 38049081613     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNC.2007.217     Document Type: Conference Paper

References (17)

1. E. L. Lawler, J. K. Lenstra, A. H. G. R Kan, and D. B. Shmoys, eds., The Traveling Salesman Problem. Chichester: John Wiley, 1985.
2. C. Barnhart, N. L. Boland, L. W. Clarke, E. L. Johnson, G. L. Nemhauser, and R. G. Shenoi. "Flight string models for aircraft fleeting and routing," Transportation Science, vol. 32, pp. 208-220, 1998.
3. P. C. Gilmore and R. E. Gomory, "Sequencing a one state-variable machine: a solvable case of the traveling salesman problem," Operations Research, vol. 12, pp. 655-679, 1964.
4. D. Applegate, R E. Bixby, V. Chvatal, and W. Cook, "On the solution of traveling salesman problems," Documenta Mathematica - Extra Volume, ICM III, pp. 645-658, 1998.
5. R. D. Plante, T. J. Lowe, R Chandrasekanran, "The production matrix traveling salesman problem: an application and solution heuristic," Operations Research, vol. 35, pp. 772-783, 1987.
6. E. H. L. Aarts, J. H. M. Korst, and P. J. M. Laarhoven, "A quantitative analysis of the simulated annealing algorithm: a case study for the traveling salesman problem," J. Stats. Phys, vol. 50, pp. 189-206, 1988.
7. P. Laarhoven and E. H. L. Aarts, Simulated Annealing: Theory and Applications, Norwell, MA: Kluwer Academic Publishers, 1987.
8. E. H. L. Aarts, H. P. Stehouwer, "Neural networks and the travelling salesman problem," Proc. Intl. Conf. on Artificial Neural Networks, Berlin Heidelberg: Springer Verlag, 1993.
9. C. N. Fiechter, "A parallel tabu search algorithm for large traveling salesman problems," Discrete Applied Mathematics, vol. 51, pp. 243-267, July 6, 1994.
10. J. V. Potvin, "Genetic Algorithms for the Traveling Salesman Problem," Annals of Operations Research, vol. 63, pp. 339-370, 1996.
11. H. D. Jin, K. S. Leung, M. L. Wong, and Z. B. Xu, "An efficient self-organizing map designed by genetic algorithms for the traveling salesman problem. IEEE Trans, on Systems, Man, and Cybernetics Part B: Cybernetics, vol. 33, pp. 877-888, 2003.
12. J. D. Wei, D. T. Lee, "A new approach to the traveling salesman problem using genetic algorithms with priorityencoding," Proc. 2004 IEEE Congress on Evolutionary Computation, Portland, OR, June, 2004, pp. 1457-1464.
13. J. G. Lu, Y. L., Ding, B. Wu, and S. D. Xiao, "An improved strategy for GAs in structural optimization," Computers & Structures, vol. 61, pp. 1185-1191, 1996.
14. C. Y. Liu, "Immune genetic algorithm and its application on TSP," Technical Report of Nanjing University of Technology, Nanjing, 2006.
15. L. C. Jiao and L. Wang, "A novel genetic algorithm based on immunity," IEEE Transactions on Systems, Man, and Cybernetics, Part A - Systems and Humans, vol. 30, pp. 552-561, 2000.
16. B. K. Choi and B. S. Yang, "Optimal design of rotorbearing systems using immune-genetic algorithm," Transactions of the ASME Journal of Vibration and Acoustics, vol. 123, pp. 398-401, 2001.
17. J. G., Zheng, L. Wang, and L. C. Jiao, "Immune algorithm for KDD," Proc. SPIE, vol. 4553, pp. 215-220, 2001.