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...

Full description

Saved in:
Bibliographic Details
Published inComputers & operations research Vol. 31; no. 8; pp. 1215 - 1222
Main Authors Bertazzi, Luca, Paletta, Giuseppe, Speranza, M.Grazia
Format Journal Article
LanguageEnglish
Published New York Elsevier Ltd 01.07.2004
Pergamon Press Inc
Subjects
Algorithms
Computational results
Computer programming
Heuristic
Heuristic algorithms
Operations research
Period traveling salesman problem
Studies
Traveling salesman problem
Heuristic algorithms
Computational results
Period traveling salesman problem
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/S0305-0548(03)00075-3