Exponential neighbourhood local search for the traveling salesman problem
From MaRDI portal
Publication:1302597
DOI10.1016/S0305-0548(98)00064-1zbMath0971.90037WikidataQ126438895 ScholiaQ126438895MaRDI QIDQ1302597
Publication date: 6 November 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Related Items (18)
Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem ⋮ The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands ⋮ An exponential (matching based) neighborhood for the vehicle routing problem ⋮ Hybridizations of evolutionary algorithms with large neighborhood search ⋮ Upper bounds on ATSP neighborhood size. ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Construction heuristics for the asymmetric TSP. ⋮ A survey of very large-scale neighborhood search techniques ⋮ TSP tour domination and Hamilton cycle decompositions of regular digraphs ⋮ Further extension of the TSP assign neighborhood ⋮ A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem ⋮ Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP ⋮ A class of exponential neighbourhoods for the quadratic travelling salesman problem ⋮ A new ILP-based refinement heuristic for vehicle routing problems ⋮ Local search with an exponential neighborhood for the servers load balancing problem ⋮ Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number ⋮ Domination analysis of some heuristics for the traveling salesman problem
Uses Software
This page was built for publication: Exponential neighbourhood local search for the traveling salesman problem
