Reviews of the meta-heuristic algorithms for TSP

Kongzhi yu Juece/Control and Decision

Volumn 21, Issue 3, 2006, Pages

  Gao, Hai Chang ^a   Feng, Bo Qin ^a   Zhu, Li ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Ant colony algorithm; Genetic algorithm; Particle swarm optimization; Simulated annealing; Tabu search; TSP

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; NEURAL NETWORKS; OPTIMIZATION; SIMULATED ANNEALING;

ANT COLONY ALGORITHM; META HEURISTIC METHODS; PARTICLE SWARM OPTIMIZATION; TABU SEARCH;

TRAVELING SALESMAN PROBLEM;

EID: 33646345150     PISSN: 10010920     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (53)

1. Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness[M]. San Francisco: Freeman W H, 1979.
2. Lawer E, Lenstra J, Ronnooy K A, et al. The Traveling Salesman Problem[M]. New York: Wiley-International Publication, 1985.
3. Baraglia R, Hidalgo J I, Perego R. A Hybrid Heuristic for the Traveling Saleman Problem[J]. IEEE Trans on Evolutionary Computation, 2001, 5(6): 613-622.
4. Lin S, Kernighan B W. An Effective Heuristic Algorithm for the Traveling Salesman Problem[J]. Operational Research, 1973, 21(2): 486-515.
5. Colorni A, Dorigo M, Maniezzo V. Distributed Optimization by Ant Colonies[A]. Proc 1st European Conf Artificial Life Plans[C]. France: Elsevier, 1991: 134-142.
6. Holland J H. Genetic Algorithms and the Optimal Allocation of Trials[J]. SIAM J Comput, 1973: 2(2): 89-104.
7. Kirkpatrick S, Gelatt J C D, Vecchi M P. Optimization by Simulated Annealing[J]. Science, 1983, 220(4596): 671-680.
8. Glover F. Future Paths for Integer Programming and Links to Artifical Intelligence[J]. Computers and Operations Research, 1986, 13(5): 533-549.
9. Hopfield J J. Neural Networks and Physical Systems with Emergent Collective Computational Abilities[J]. Proc of the National Academy of Science, 1982, 79(4): 2554-2558.
10. Eberhart R, Kennedy J. A New Optimizer Using Particles Swarm Theory[A]. Proc 6th Int Symposium on Micro Machine and Human Science[C]. Nagoya: IEEE Service Center, Piscataway, 1995: 39-43.
11. Dasgupta D, Forrest S. Artifical Immune Systems and Their Applications[M]. Berlin: Spring-Verlag, 1998: 267-277.
12. Wang L. Intelligent Optimization Algorithms Applications[M]. Beijing: Tsinghua University Press, 2001.
13. Dorigo M, Gambardella L M. A Study of Some Properties of Ant-Q[A]. Proc of the PPSN 44th Int Conf on Parallet Problem Solving from Nature[C]. Berlin: Springer Verlag, 1996: 656-665.
14. Stutzle T, Hoos H H. MAX-MIN Ant System[J]. Future Generation Computer Systems, 2000, 16(8): 889-914.
15. Gambardella L M, Dorigo M. An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem[J]. INFORMS J on Computing, 2000, 12(3): 237-255.
16. Gutjahr W J. A Graph-based Ant System and Its Convergence[J]. Future Generation Computer System, 2000, 16(8): 873-888.
17. Tsai C F, Tsai C W. A New Approach for Solving Large Traveling Salesman Problem Using Evolution Ant Rules[J]. Neural Networks, IJCNN 2002, Proc of the 2002 Int'l Joint Conf on[C]. Honolulu: IEEE Press, 2002, 2: 1540-1545.
18. Wu Q H, Zhang J H, Xu X H. An Ant Colony Algorithm with Mutation Features[J]. J of Computer Research and Development, 1999, 36(10): 1240-1245.
19. Zhang J H, Gao Q S, Xu X H. A Self-adaptive Ant Colony Algorithm[J]. Control Theory and Applications, 2000, 17(1): 1-3.
20. Wu B, Shi Z Z. An Ant Colony Algorithm Based Partition Algorithm for TSP[J]. Chinese J Computers, 2001, 24(12): 1328-1333.
21. Kenneth A Dejong. Genetic Algorithms: A 25 Year Perspective[A]. Computational Intelligence: Imitating Life, WCCI94[C]. 1994: 124-125.
22. Goldberg D E. Alleles, Loci and the Traveling Salesman Problem[J]. Proc of the 1st Int Conf on Genetic Algorithms and Their Applications[C]. Pittsburgh: Pittsbrugh P A Carnegie Mellon University, 1985: 154-159.
23. Grefenstette J J, Gopal R, Rosmaita B, et al. Genetic Algorithm for TSP[J]. Proc of the 1st Int Conf on Genetic Algorithms and Their Applications[C]. Pittsburgh: Pittsbrugh P A Carnegie Mellon University, 1985: 160-168.
24. Goldberg D E. Genetic Algorithms in Search, Optimization and Machine Learning[A]. MA: Addison Wesley Reading, 1989: 1-10.
25. Cheng R W, Gen M. Crossover on Intensive Search and Traveling Salesman Problem[A]. Proc of Kith Int Conf on Computer and Industrial Engineering[C]. Japan: Nagoya Institute of Technology, 1994, 7-9: 568-579.
26. Tang L X. Improved Genetic Algorithm for TSP[J]. J of Northeastern University, 1999, 20(1): 40-42.
27. Yang H, Kang L S, Chen Y P. A Gene-based Genetic Algorithm for TSP[J]. Chinese J of Computers, 2003, 26(12): 1753-1758.
28. Wang L, Pan J, Jiao L C. The Immune Algorithm[J]. Acta Electronica Sinica, 2000, 28(7): 74-78.
29. Dejong K A. An Analysis of the Behaviour of a Class of Genetic Adaptive Systems[D]. Michigan: University of Michigan, Ann Arbor, 1975.
30. Goldberg D E, Richardson J. Genetic Algorithm with Sharing for Multimodal Function Optimization[A]. Proc of the Int Conf on Genetic Algorithms[C]. Lawrence Erlbaum, 1987: 41-49.
31. Metroplois N, Rosenbluth A W, Rosenbulth M N, et al. Equation of State Calculations by Fast Computing Machines[J]. J of Chemical Physica, 1953, 21(6): 1087-1092.
32. Kang L S, Xie Y, You S Y, et al. Nonnumerical Parallel Algorithm (Part I): Simulated Annealing Algorithm[M]. Beijing: Science Press, 1994: 150-151.
33. Wilhelm M R, Ward T L. Solving Quadratic Assignment Problems by Simulated Annealing[J]. IEEE Trans, 1987, 19(1): 107-119.
34. Dvis L, Ritter F. Schedule Optimization with Probabilistic Search[A]. Proc of 3rd IEEE Conf on Artificial Intelligence Applications[C]. Orlando, 1987: 231-235.
35. Lundy M, Mess A. Convergence of an Annealing Algorithm[J]. Mathematical Programming, 1986, 34(1): 111-124.
36. Yang G W, Zheng W M, Wang D X, et al. An Algorithm for Traveling Salesman Problem Using Deterministic Annealing[J]. J of Software, 1999, 10(1): 57-59.
37. Gao G H, Shen L C, Chang W S. Using Simulated Annealing Algorithm with Search Space Sharping to Solve TSP[J]. Acta Automation Sinica, 1999, 25(3): 425-428.
38. Glover F. Tabu Search: Part I[J]. ORSA J on Computing, 1989, 1(3): 190-206.
39. Shane N H. A Group Theoretic Tabu Search Approach to the Traveling Salesman Problem[EB/OL]. http://www.au.af.mil/au/database/summaryfile.html, 2002-03-23.
40. Michel G, Gilbert L, Frederic S. A Tabu Search Heuristic for the Undirected Selective Traveling Salesman Problem[J]. European J of Operational, 1998, 106(1): 539-545.
41. Fang Y H, Liu G Y, He Y, et al. A Tabu Search Algorithm Based on Insertion Method[J]. J of Southwest China Normal University, 2003, 28(6): 887-891.
42. Hopfield J J, Tank D W. Neural Computation of Decision in Optimization Problem[J]. Biol Cybern, 1985, 52(1): 141-152.
43. Wang L, Zheng D Z. Study on TSP and Optimization Based on Hopfield Neural Network[J]. Control and Decision, 1999, 14(6): 670-674.
44. Wilson V, Pawlay G S. On the Stability of the TSP Problem Algorithm of Hopfield and Tank[J]. Biol Cybern, 1988, 58(1): 63-70.
45. Xu X, Tsai W T. Effective Neural Algorithms for the Traveling Salesman Problem[J]. Neural Network, 1991, 4(1): 193-205.
46. Wang S, Tsai C M. Hopfield Nets with Time-varying Energy Function for Solving the Traveling Salesman Problem[A]. Int J Conf on Neural Networks[C]. Seattle, Washington, 1991: 807-812.
47. Aiyer S V B, Niranjan M, Fallside F. A Theoretical Investigation into the Performance of the Hopfield Model[J]. IEEE Trans on Neural Networks, 1990, 1(2): 204-215.
48. Ackley D H, Hinton G E, Sejnowski T J. A Learning Algorithm for Boltzmann Machines[J]. Cognitive Science, 1985, 9(1): 147-169.
49. Tang Z, Jin H H, Murao K, et al. A Gradient Ascent Learning for Hopfield Networks[J]. Trans of IEICE of Japan, 2000, J83-A(3): 319-331.
50. Jin H H, Chen J, Tang Z, et al. Learning Algorithm for Solving Local Minimum Problems Based on Hopfield Network[J]. J of Tsinghua University, 2002, 42(6): 731-734.
51. Shi Y H, Eberhart R C. A Modified Particle Swarm Optimizer[A]. IEEE Int Conf on Evolutionary Computation[C]. Anchorage, 1998: 69-73.
52. Maurice Clerc. Discrete Particle Swarm Optimization Illustrated by the Traveling Salesman Problem[DB/OL]. http://www.mauriceclerc.net, 2000.
53. Gao S, Han B, Wu X J. et al. Solving Traveling Salesman Problem by Hybrid Particle Swarm Optimization Algorithm[J]. Control and Decision, 2004, 19(11): 1286-1289.