Paper Info
Title
An improved heuristic for the period traveling salesman problem
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.
Year
DOI
Venue
2004
10.1016/S0305-0548(03)00075-3
Computers & OR
Keywords
DocType
Volume
salesman problem Computational result,Period traveling salesman problem,Heuristic algorithms,literature show,improved heuristic,heuristic algorithm,classical test instance,total distance,best-known total distance,Computational results
Journal
31
Issue
ISSN
Citations 
8
Computers and Operations Research
12
PageRank 
References 
Authors
0.79
5
3
Name
Order
Citations
PageRank
Luca Bertazzi147726.88
Giuseppe Paletta222416.20
M. Grazia Speranza366345.44