Title of article
An improved heuristic for the period traveling salesman problem
Author/Authors
Luca Bertazzi، نويسنده , , Giuseppe Palett، نويسنده , , M. Grazia Speranza، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2004
Pages
8
From page
1215
To page
1222
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.
Keywords
Heuristic algorithms , Computational results , Period traveling salesman problem
Journal title
Computers and Operations Research
Serial Year
2004
Journal title
Computers and Operations Research
Record number
928077
Link To Document