Further extension of the TSP assign neighborhood

DOI10.1007/s10732-005-3487-yzbMath1122.90401MaRDI QIDQ2491321

Fred Glover, Gregory Gutin

Publication date: 29 May 2006

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-005-3487-y

zbMATH Keywords

local search; traveling salesman problem; exponential neighborhood; assign neighborhood

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Exponential neighbourhood local search for the traveling salesman problem
• Upper bounds on ATSP neighborhood size.
• A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
• A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
• Data structures and ejection chains for solving large-scale traveling salesman problems
• A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
• A new ILP-based refinement heuristic for vehicle routing problems
• The Travelling Salesman and the PQ-Tree
• The traveling salesman problem: new polynomial approximation algorithms and domination analysis
• Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study