Match twice and stitch: a new TSP tour construction heuristic

Authors:
Andrew B Kahng;Sherief Reda
Affiliations:
UCSD Computer Science & Engineering Department, 9500 Gilman Drive, MS 0114, La Jolla, CA 92093-0114, USA;UCSD Computer Science & Engineering Department, 9500 Gilman Drive, MS 0114, La Jolla, CA 92093-0114, USA
Venue:
Operations Research Letters
Year:
2004

Citing 6
Cited 6

Spacefilling curves and the planar travelling salesman problem

Journal of the ACM (JACM)
A 7/8-approximation algorithm for metric Max TSP

Information Processing Letters
Improved Large-Step Markov Chain Variants for the Symmetric TSP

Journal of Heuristics
Computing Minimum-Weight Perfect Matchings

INFORMS Journal on Computing
Editorial: The traveling salesman problem

Discrete Optimization
Large-step markov chains for the TSP incorporating local search heuristics

Operations Research Letters

Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough?

Journal of Experimental Algorithmics (JEA)
Fast minimum-weight double-tree shortcutting for metric TSP

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Improving the efficiency of Helsgaun's Lin-Kernighan Heuristic for the symmetric TSP

CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Reordering rows for better compression: Beyond the lexicographic order

ACM Transactions on Database Systems (TODS)
A GPU algorithm for greedy graph matching

Facing the Multicore-Challenge II
Comparative study of artificial bee colony algorithms with heuristic swap operators for traveling salesman problem

ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new symmetric traveling salesman problem tour construction heuristic. Two sequential matchings yield a set of cycles over the given point set; these are then stitched to form a tour. Our method outperforms all previous tour construction methods, but is dominated by several tour improvement heuristics.