Chained Lin-Kernighan for large traveling salesman problems
From MaRDI portal
Publication:2884550
Recommendations
Cited in
(49)- Generalization of machine learning for problem reduction: a case study on travelling salesman problems
- 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
- Two-phase Pareto local search for the biobjective traveling salesman problem
- A location-routing problem in glass recycling
- Speed-up techniques for solving large-scale biobjective TSP
- An ILP-refined tabu search for the directed profitable rural postman problem
- Large-step Markov chains for the TSP incorporating local search heuristics
- Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP
- Dubins traveling salesman problem with neighborhoods: a graph-based approach
- Vehicle routing with time-dependent travel times: theory, practice, and benchmarks
- Genetic operators for combinatorial optimization in TSP and microarray gene ordering
- TSP race: minimizing completion time in time-sensitive applications
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
- Exact algorithms for the order picking 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
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- A Multilevel Approach to the Travelling Salesman Problem
- A weighted-sum method for solving the bi-objective traveling thief problem
- Ejection chain and filter-and-fan methods in combinatorial optimization
- 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
- Efficiently solving the traveling thief problem using hill climbing and simulated annealing
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
- 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
- A linearithmic heuristic for the travelling salesman problem
- Exponential neighborhood search for consecutive block minimization
- Embedded local search approaches for routing optimization
- The packing while traveling problem
- Embedding a chained Lin-Kernighan algorithm into a distributed algorithm
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)
