The Traveling Salesman Problem with Time Windows has important applications in routing and scheduling and has been extensively studied in literature. In the paper, a mathematical formulation of the temporal-Traveling Salesman Problem with Time Windows is presented and a metaheuristic based on Ant Colony System is proposed and implemented. Computational experience on a benchmark problem is reported and a case study is analyzed, where interesting results are obtained.
An ant colony system approach for variants of traveling salesman problem with time windows
FAVARETTO, Daniela;MORETTI, Elena;PELLEGRINI, Paola
2006-01-01
Abstract
The Traveling Salesman Problem with Time Windows has important applications in routing and scheduling and has been extensively studied in literature. In the paper, a mathematical formulation of the temporal-Traveling Salesman Problem with Time Windows is presented and a metaheuristic based on Ant Colony System is proposed and implemented. Computational experience on a benchmark problem is reported and a case study is analyzed, where interesting results are obtained.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
JouInfo&OptSci27(1)_2006.pdf
accesso aperto
Tipologia:
Documento in Post-print
Licenza:
Licenza non definita
Dimensione
207.3 kB
Formato
Adobe PDF
|
207.3 kB | Adobe PDF | Visualizza/Apri |
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
