Title: Local Search for the Asymmetric Traveling Salesman Problem
Abstract: We present an extension of the Lin-Kernighan local search algorithm for the solution of the asymmetric traveling salesman problem. Computational results suggest that our heuristic is feasible for fairly large instances. We also present some theoretical results which guided our design of the heuristic.
Publication Year: 1980
Publication Date: 1980-10-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 108
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot