Effective Local and Guided Variable Neighbourhood Search Methods for the Asymmetric Travelling Salesman Problem
- 6 April 2001
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 203-212
- https://doi.org/10.1007/3-540-45365-2_21
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Genetic local search for the TSP: new resultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Construction heuristics for the asymmetric TSPEuropean Journal of Operational Research, 2001
- Fast Algorithms for Geometric Traveling Salesman ProblemsINFORMS Journal on Computing, 1992
- Exact solution of the no-wait flowshop scheduling problem with a comparison to heuristic methodsComputers & Chemical Engineering, 1991
- An Algorithm for NC Turret Punch Press Tool Location and Hit SequencingIIE Transactions, 1984
- On the worst‐case performance of some algorithms for the asymmetric traveling salesman problemNetworks, 1982
- Local Search for the Asymmetric Traveling Salesman ProblemOperations Research, 1980
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman ProblemSIAM Journal on Computing, 1979
- On the Complexity of Local Search for the Traveling Salesman ProblemSIAM Journal on Computing, 1977
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973