View article

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.