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
Online AccessGet full text

Cover

Loading…