An improved greedy algorithm with information of edges' location for solving the Euclidean traveling salesman problem

Jisuanji Xuebao/Chinese Journal of Computers

Volumn 36, Issue 4, 2013, Pages 836-850

  Rao, Wei Zhen ^a,b   Jin, Chun ^a   Lu, Lin Tao ^c  

^a DALIAN UNIVERSITY OF TECHNOLOGY   (China)

^b SHANDONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^c Chinese people's Liberation Army 92537 armed forces   (China)

Author keywords

Euclidean traveling salesman problem; Greedy algorithm; Michael model; Quality of solution; Running time

Indexed keywords

COMPUTATIONAL RESULTS; CONSTRUCTION METHOD; EUCLIDEAN; GREEDY ALGORITHMS; QUALITY OF SOLUTION; RUNNING TIME;

TRAVELING SALESMAN PROBLEM;

ALGORITHMS;

EID: 84877904580     PISSN: 02544164     EISSN: None     Source Type: Journal    
DOI: 10.3724/SP.J.1016.2013.00836     Document Type: Article

References (29)

1. Rego C, Gamboa D, Glover F, Osterman C. Traveling salesman problem heuristics: Leading methods, implementations and latest advances. European Journal of Operational Research, 2011, 211(3): 427-441
2. Junger M, Reinelt G, Rinaldi G. Handbooks in OR&MS: Chapter4 The traveling salesman problem. North-Holland, Amsterdam: Elsevier Science, 1995
3. Rao Wei-Zhen, Jin Chun, Huang Ying-Yi. Two directions moving with difference algorithm to solve Traveling Salesman Problem. Journal of Engineering Management, 2011, 25(2): 95-102 (in Chinese)
4. Dorigo M, Stutzle T. Ant Colony Optimization. Massachusetts: MIT Press, 2004
5. Johnson D S, McGeoch L A. The Traveling Salesman Problem: A case study in local optimization. Local Search in Combinatorial Optimization. New York: Wiley, 1997: 215-310
6. Lin S, Kernighan B W. An effective heuristic algorithm for the traveling salesman problem. Operations Research, 1973, 21(2): 498-516
7. Helsgaun K. An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research, 2000, 126(1): 106-130
8. Glover F. Tabu search-Part I. ORSA Journal on Computing, 1989, 1(3): 190-206
9. Glover F. Tabu search-Part II. ORSA Journal on Computing, 1990, 2(1): 4-32
10. Xing Ling-Ning. A hybrid approach combining an improved genetic algorithm and optimization strategies for the asymmetric traveling salesman problem. Engineering Applications of Artificial Intelligence, 2008, 21(8): 1370-1380
11. Kirkpatrick S, Gelatt C D, Vecchi M P. Optimization by simulated annealing. Science, 1983, 220(4598): 671-680
12. Pesch E, Glover F. TSP ejection chains. Discrete Applied Mathematics, 1997, 76(1-3): 165-181
13. Dorigo M, Di C G, Gambardella L M. Ant algorithms for distributed discrete optimization. Artificial Life, 1999, 5(2): 137-172
14. Zhou Peng, Zhou Zhi, Jiang He, Chen Guo-Liang, Gu Jun. Analysis of the run-time distribution and solution performance distribution of iterated local search for the TSP. Chinese Journal of Computers, 2006, 29(1): 92-99 (in Chinese)
15. Li Man-Li, Zhang Yi, Min Zhu. Solving TSP by using Lotka-Volterra neural networks. Neurocomputing, 2009, 72(16-18): 3873-3880
16. Marinakis Y, Marinaki M. A hybrid multi-swarm particle swarm optimization algorithm for the Probabilistic Traveling Salesman Problem. Computers & Operations Research, 2010, 37(3): 432-442
17. Zhong Yi-Wen, Yang Jian-Gang, Ning Zheng-Yuan. Discrete particle swarm optimization algorithm for TSP problem. Systems Engineering-Theory & Practice, 2006, 26(6): 88-94 (in Chinese)
18. Letchford A N, Pearson N A. Good triangulations yields good tours. Computers & Operations Research, 2008, 35(2): 638-647
19. Walshaw C. A multilevel approach to the traveling salesman problem. Operations Research, 2002, 50(5): 862-877
20. Zhao F G, Sun J S, Li S J, et al. A hybrid genetic algorithm for the traveling salesman problem with pickup and delivery. International Journal of Automation and Computing, 2009, 6(1): 97-102
21. Liu Chao-Hua, Zhang Ying-Jie, Zhang Jing. Using combination of ant algorithm and immune algorithm to solve TSP. Control and Decision, 2010, 25(5): 695-701 (in Chinese)
22. Licas A, Vangelis T P, Glover F. A note on a new greedy-solution representation and a new greedy parallelizable heuristic for traveling salesman problem. Chaos Solitons & Fractals, 2002, 13(1): 71-78
23. Held M, Karp R M. The traveling salesman problem and minimum spanning trees. Operations Research, 1970, 18(6): 1138-1162
24. Bentley J J. Fast algorithm for geometric traveling salesman problem. ORSA Journal on Computing, 1992, 4(4): 387-411
25. Vince A. A framework for the greedy algorithm. Discrete Applied Mathematics, 2002, 121(1-3): 247-260
26. Kang Li-Shan, Xie Yun, You Shi-Yong, et al. Nonnumeric parallelization algorithm-simulated annealing algorithm. Beijing: Science Press, 1994 (in Chinese)
27. Gamboa D, Rego C, Glover F. Implementation analysis of efficient heuristic algorithms for the traveling salesman problem. Computers & Operations Research, 2006, 33(4): 1154-1172
28. Fredman M L, Johnson D S, McGeoch L A, et al. Data structures for traveling salesmen. Algorithm, 1995, 18(3): 432-479
29. Bentley J L. K-d trees for semidynamic point sets//Proceedings of the Annual ACM Symposium on Computational Geometry. New York, 1990: 187-197