Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
From MaRDI portal
Recommendations
- Traveling salesman problem heuristics: leading methods, implementations and latest advances
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An efficient heuristic algorithm for the bottleneck traveling salesman problem
- Worst-case analysis of a new heuristic for the travelling salesman problem
- Experimental analysis of heuristics for the bottleneck traveling salesman problem
- On the refinement of bounds of heuristic algorithms for the traveling salesman problem
- The travelling salesman problem: selected algorithms and heuristics†
- scientific article; zbMATH DE number 7310206
- Domination analysis of some heuristics for the traveling salesman problem
Cites work
- scientific article; zbMATH DE number 1082106 (Why is no real title available?)
- A Multilevel Approach to the Travelling Salesman Problem
- A data structure useful for finding Hamiltonian cycles
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Chained Lin-Kernighan for large traveling salesman problems
- Data Structures for Traveling Salesmen
- Data structures and ejection chains for solving large-scale traveling salesman problems
- Fast Heuristics for Large Geometric Traveling Salesman Problems
- Relaxed tours and path ejections for the traveling salesman problem
- TSPLIB—A Traveling Salesman Problem Library
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
Cited in
(19)- Mathematical model for dynamic case-based planning
- Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- scientific article; zbMATH DE number 7310206 (Why is no real title available?)
- Analysing the run-time behaviour of iterated local search for the travelling salesman problem.
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- An efficient implementation of a static move descriptor-based local search heuristic
- Data structures and ejection chains for solving large-scale traveling salesman problems
- Traveling salesman problem heuristics: leading methods, implementations and latest advances
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Genetic operators for combinatorial optimization in TSP and microarray gene ordering
- Ejection chain and filter-and-fan methods in combinatorial optimization
- Ejection chain and filter-and-fan methods in combinatorial optimization
- Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem
- Application of imperialist competitive algorithm on solving the traveling salesman problem
- A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP
- A survey on the linear ordering problem for weighted or unweighted tournaments
- A \(k\)-level data structure for large-scale traveling salesman problems
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
This page was built for publication: Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571201)
