The vehicle routing problem with time windows is frequently found in literature, while multiple time windows are not often considered. In this paper a mathematical formulation of the vehicle routing problem with multiple time windows is presented, taking into account periodic constraints. A meta-heuristic based on Ant Colony System is proposed and implemented. Computational results related to a purpose-built benchmark are finally reported.
Ant colony system for a VRP with multiple time windows and multiple visits
FAVARETTO, Daniela;MORETTI, Elena;PELLEGRINI, Paola
2007-01-01
Abstract
The vehicle routing problem with time windows is frequently found in literature, while multiple time windows are not often considered. In this paper a mathematical formulation of the vehicle routing problem with multiple time windows is presented, taking into account periodic constraints. A meta-heuristic based on Ant Colony System is proposed and implemented. Computational results related to a purpose-built benchmark are finally reported.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
JouIntMath10(2)_2007.pdf
accesso aperto
Tipologia:
Documento in Post-print
Licenza:
Licenza non definita
Dimensione
212 kB
Formato
Adobe PDF
|
212 kB | Adobe PDF | Visualizza/Apri |
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
