Title: Diversified Local Search for the Traveling Salesman Problem
Abstract: In this paper we propose a local search based improvement heuristic called diversifled local search for the traveling salesman problem. We show through computational experiments that this algorithm outperforms tabu search with similar neighborhood structures on large sized traveling salesman problem instances.
Publication Year: 2011
Publication Date: 2011-01-11
Language: en
Type: preprint
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot