PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Further Extension of TSP Assign Neighborhood
Gregory Gutin and Fred Glover
Journal of Heuristics Volume 11, pp. 501-505, 2005.

Abstract

We introduce a new extension of Punnen's exponential neighborhood for the traveling salesman problem (TSP). In contrast to an interesting generalization of Punnen's neighborhood by De Franceschi, Fischetti and Toth (2005), our neighborhood is searchable in polynomial time, a feature that invites exploitation by heuristic and metaheuristic procedures for the TSP and related problems, including those of De Franceschi, Fischetti and Toth (2005) for the vehicle routing problem.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
Theory & Algorithms
ID Code:938
Deposited By:Gregory Gutin
Deposited On:04 February 2005