Exponential neighbourhood local search for the traveling salesman problem
From MaRDI portal
Publication:1302597
DOI10.1016/S0305-0548(98)00064-1zbMath0971.90037MaRDI QIDQ1302597
Publication date: 6 November 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
90B40: Search theory
Related Items
Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP, Construction heuristics for the asymmetric TSP., TSP tour domination and Hamilton cycle decompositions of regular digraphs, A survey of very large-scale neighborhood search techniques, A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem, Upper bounds on ATSP neighborhood size., Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number, Domination analysis of some heuristics for the traveling salesman problem, An exponential (matching based) neighborhood for the vehicle routing problem, Further extension of the TSP assign neighborhood, A new ILP-based refinement heuristic for vehicle routing problems
Uses Software