Chained Lin-Kernighan for large traveling salesman problems
From MaRDI portal
Publication:2884550
DOI10.1287/IJOC.15.1.82.15157zbMATH Open1238.90125OpenAlexW2140425706MaRDI QIDQ2884550FDOQ2884550
Authors: David Applegate, André Rohe, William Cook 
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2de975652951a58e004a11c5041ad7a36f9fc91b
Recommendations
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (49)
- A genetic algorithm for multi-component optimization problems: the case of the travelling thief problem
- Knowledge-guided local search for the vehicle routing problem
- POPMUSIC for the travelling salesman problem
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
- An efficient local search for the feedback vertex set problem
- Efficiently solving very large-scale routing problems
- An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem
- The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
- A location-routing problem in glass recycling
- Two-phase Pareto local search for the biobjective traveling salesman problem
- Speed-up techniques for solving large-scale biobjective TSP
- Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP
- Large-step Markov chains for the TSP incorporating local search heuristics
- An ILP-refined tabu search for the directed profitable rural postman problem
- Vehicle routing with time-dependent travel times: theory, practice, and benchmarks
- Dubins traveling salesman problem with neighborhoods: a graph-based approach
- Genetic operators for combinatorial optimization in TSP and microarray gene ordering
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
- TSP race: minimizing completion time in time-sensitive applications
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- Exact algorithms for the order picking problem
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
- Traveling salesman problem heuristics: leading methods, implementations and latest advances
- A modified Lin--Kernighan traveling-salesman heuristic
- Solving large-scale TSP using a fast wedging insertion partitioning approach
- A Multilevel Approach to the Travelling Salesman Problem
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Ejection chain and filter-and-fan methods in combinatorial optimization
- A weighted-sum method for solving the bi-objective traveling thief problem
- Proper balance between search towards and along Pareto front: biobjective TSP case study
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
- A note on single alternating cycle neighborhoods for the TSP
- Ejection chain and filter-and-fan methods in combinatorial optimization
- An effective local search for the maximum clique problem
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
- Efficiently solving the traveling thief problem using hill climbing and simulated annealing
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
- A discrete gravitational search algorithm for solving combinatorial optimization problems
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem
- A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP
- Exponential neighborhood search for consecutive block minimization
- A linearithmic heuristic for the travelling salesman problem
- Embedded local search approaches for routing optimization
- The packing while traveling problem
- Embedding a chained Lin-Kernighan algorithm into a distributed algorithm
- Generalization of machine learning for problem reduction: a case study on travelling salesman problems
Uses Software
This page was built for publication: Chained Lin-Kernighan for large traveling salesman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884550)
