Match twice and stitch: a new traveling salesman problem tour construction heuristic

Match twice and stitch: a new traveling salesman problem tour construction heuristic

0.00 Avg rating0 Votes
Article ID: iaor2005760
Country: Netherlands
Volume: 32
Issue: 6
Start Page Number: 499
End Page Number: 509
Publication Date: Nov 2004
Journal: Operations Research Letters
Authors: ,
Keywords: heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.