Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
From MaRDI portal
Publication:1357488
DOI10.1007/BF00247211zbMATH Open0869.90075MaRDI QIDQ1357488FDOQ1357488
Authors: Fred Glover 
Publication date: 2 September 1997
Published in: Journal of Heuristics (Search for Journal in Brave)
Recommendations
- Reoptimizing the traveling salesman problem
- A 4/5 -- approximation algorithm for the maximum traveling salesman problem
- AN EXACTLY OPTIMAL STRATEGY FOR A SEARCH PROBLEM WITH TRAVELING COST
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- Algorithmic strategies for a fast exploration of the TSP 4-OPT neighborhood
- Solving the \(k\)-best traveling salesman problem
- Reoptimization of minimum and maximum traveling salesman's tours
- Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
- Nonoblivious 2-opt heuristics for the traveling salesman problem
- Optimal bounds for the analytical traveling salesman problem
Cited In (14)
- Solution of real-world postman problems
- Algorithmic strategies for a fast exploration of the TSP 4-OPT neighborhood
- Fast local search algorithms for the handicapped persons transportation problem
- A survey of very large-scale neighborhood search techniques
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
- Relaxed tours and path ejections for the traveling salesman problem
- Large multiple neighborhood search for the clustered vehicle-routing problem
- Traveling salesman problem heuristics: leading methods, implementations and latest advances
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem
- Improving TSP tours using dynamic programming over tree decompositions
- Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs
- Multiple \(k\)-opt evaluation multiple \(k\)-opt moves with GPU high performance local search to large-scale traveling salesman problems
- Embedded local search approaches for routing optimization
This page was built for publication: Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1357488)
