We propose a heuristic algorithm for the solution of the periodtraveling salesman problem. Computational results obtainedon the classical test instances of the literature show that the total distance obtainedby 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.
An Improved Heuristic for the Period Traveling Salesman Problem
PALETTA, Giuseppe;
2004-01-01
Abstract
We propose a heuristic algorithm for the solution of the periodtraveling salesman problem. Computational results obtainedon the classical test instances of the literature show that the total distance obtainedby 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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
