A fast composite heuristic for the symmetric traveling salesman problem

A fast composite heuristic for the symmetric traveling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor19983048
Country: United States
Volume: 8
Issue: 2
Start Page Number: 134
End Page Number: 143
Publication Date: Mar 1996
Journal: INFORMS Journal On Computing
Authors: , ,
Keywords: heuristics, programming: assignment, optimization
Abstract:

This article describes a new composite heuristic for the symmetric Traveling Salesman Problem. The heuristic consists of three phases: construction of an initial envelope, insertion of the remaining vertices, and improvement procedure. The heuristic is shown to perform very well both on randomly generated instances and on TSPLIB problems.

Reviews

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