Match twice and stitch: A new TSP tour construction heuristic

Operations Research Letters

Volumn 32, Issue 6, 2004, Pages 499-509

  Kahng, Andrew B ^a   Reda, Sherief ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Heuristic; Tour construction; Traveling salesman problem

Indexed keywords

BENCHMARKING; CONSTRAINT THEORY; COSTS; EDGE DETECTION; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

CYCLIC CONSTRUCTION; MINIMUM SPANNING TREE (MST); TOUR CONSTRUCTION;

TRAVELING SALESMAN PROBLEM;

EID: 3042857114     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.04.001     Document Type: Article

References (24)

1. http://www.research.att.com/~dsj/chtsp. TSP Challenge Website.
2. Bentley J.L. Fast algorithms for geometric traveling salesman problems. ORSA J. Comput. 4:1992;387-411.
3. N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Technical Report 388, GSIA, Carnegie-Mellon University, Pittsburgh, PA, 1976.
4. Clarke G., Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12:1964;568-581.
5. Cook W., Rohe A. Computing minimum weight perfect matchings, http://www.or.uni-bonn.de/home/rohe/matching.html. INFORMS J. Comput. 11:1999;38-148.
6. Croes G.A. The traveling-salesman problem. Oper. Res. 4:1956;61-75.
7. Croes G.A. A method for solving traveling salesman problems. Oper. Res. 6:1958;791-812.
8. Cunningham W.H., Wang Y. Restricted 2-factor polytopes. Math. Programming. 87(1):2000;87-111.
9. Fisher M.L., Nemhauser G.L., Wolsey L.A. An analysis of approximations for finding a maximum weight Hamiltonian circuit. Oper. Res. 27(4):1979;799-809.
10. Gilmore P.C., Gomory R.E. Sequencing a one state-variable machine: a solvable case of the traveling salesman problem. Oper. Res. 12:1964;655-679.
11. Golden B.L., Stewart W.R. Empirical analysis of heuristics. Lawler E.L., et al. The Traveling Salesman Problem. 1985;207-249 Wiley, Chichester.
12. G. Gutin, A.P. Punnen (Eds.), The Traveling Salesman Problem and Its Variations, Kluwer Academic Publishers, Dordrecht, 2002.
13. Hassin R., Rubinstein S. A 7/8-approximation algorithm for metric max TSP. Inform. Process. Lett. 81(5):2002;247-251.
14. Held M., Karp R. The traveling salesman problem and minimum spanning trees. Oper. Res. 18:1970;1138-1162.
15. Held M., Karp R. The traveling salesman problem and minimum spanning trees. part II Math. Programming. 1:1971;6-52.
16. Hong I., Kahng A.B., Moon B. Improved large-step Markov chains for the symmetric TSP. J. Heuristics. 3:1997;63-81.
17. Johnson D., McGeoch L. Experimental analysis of heuristics for the STSP. G. Gutin In, Punnen A. The Traveling Salesman Problem and its Variations. 2002;Kluwer Academic Publishers, Dordrecht.
18. Karp R.M. A patching algorithm for the non-symmetric traveling-salesman problem. SIAM J. Comput. 8(4):1979;561-573.
19. Lin S., Kernighan B. An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21:1973;498-516.
20. Lovasz L., Plummer M.D. Matching Theory. 1986;North-Holland, Amsterdam.
21. Martin O., Otto S.W., Felten E.W. Large-step Markov chains for the TSP incorporating local search heuristics. Oper. Res. Lett. 11:1992;219-224.
22. Platzman L.K., Bartholdi J.J. Spacefilling curves and planar traveling salesman problem. J. ACM. 36:1989;719-737.
23. Schrijver A. Combinatorial Optimization. Polyhedra and Efficiency:2003;Springer, Berlin.
24. O. Vornberger, Easy and hard cycle covers, Technical Report, Universitat Paderborn, 1980.