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.
|Titolo:||Ant colony system for a VRP with multiple time windows and multiple visits|
|Data di pubblicazione:||2007|
|Appare nelle tipologie:||2.1 Articolo su rivista |