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.
An improved heuristic for the period traveling salesman problem
BERTAZZI, Luca;SPERANZA, Maria Grazia
2004-01-01
Abstract
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
improved.pdf
gestori archivio
Tipologia:
Full Text
Licenza:
DRM non definito
Dimensione
190.45 kB
Formato
Adobe PDF
|
190.45 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
