A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
Jacques Renaud, Fayez F. Boctor, Gilbert Laporte
INFORMS Journal on Computing · 1996 · Volume 8 · Issue 2
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.
Keywords
networks/graphs, symmetric traveling salesman problem, heuristic
Enable JavaScript for citation tools and additional paper interactions.