Further Extension of the TSP Assign Neighborhood

Authors:
Gregory Gutin;Fred Glover
Affiliations:
Department of Computer Science, Royal Holloway, University of London, Egham, Surrey, UK TW20 0EX;School of Business, University of Colorado, Boulder, USA 80309-0419
Venue:
Journal of Heuristics
Year:
2005

Citing 6
Cited 1

Structural complexity 1

Structural complexity 1
The Travelling Salesman and the Pq-Tree

Mathematics of Operations Research
Exponential neighbourhood local search for the traveling salesman problem

Computers and Operations Research - Special issue on the traveling salesman problem
Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study

INFORMS Journal on Computing
Upper bounds on ATSP neighborhood size

Discrete Applied Mathematics
A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem

Operations Research Letters

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

Quantified Score

Hi-index	0.04

Visualization

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.