An improved heuristic for the period traveling salesman problem

An improved heuristic for the period traveling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor20043762
Country: United Kingdom
Volume: 31
Issue: 8
Start Page Number: 1215
End Page Number: 1222
Publication Date: Jul 2004
Journal: Computers and Operations Research
Authors: , ,
Keywords: heuristics
Abstract:

We propose a heuristic algorithm for the solution of the period traveling salesman problem. Computational results obtained on the classical test instances of the literature show that the total distance obtained by the algorithm is not worse than the best-known total distance in 95% of the instances and is strictly better in 18 of the 40 tested instances.

Reviews

Required fields are marked *. Your email address will not be published.