An improved heuristic for the period traveling salesman problem
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...
Saved in:
Published in | Computers & operations research Vol. 31; no. 8; pp. 1215 - 1222 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
New York
Elsevier Ltd
01.07.2004
Pergamon Press Inc |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!