The Vehicle Routing Problem with Time Windows and Time-Dependent Road-Network Information
Hamza Ben Ticha  1, 2@  , Nabil Absi  1, 2@  , Dominique Feillet  1, 2@  , Alain Quilliot  3@  , Tom Van Woensel  4@  
1 : Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes  (LIMOS)  -  Website
CNRS : UMR6158
F-13541 Gardanne -  France
2 : Ecole des Mines de Saint-Etienne  (EMSE)  -  Website
Ecole des Mines de Saint-Etienne
Campus Georges Charpak Provence, F-13451 Gardanne, France -  France
3 : Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes  (LIMOS)  -  Website
CNRS : UMR6158, Université Clermont Auvergne
Bât ISIMA Campus des Cézeaux BP 10025 63173 AUBIERE cedex -  France
4 : Eindhoven University of Technology

In the literature, most approaches proposed to solve time-dependent vehicle routing problems assume that for each pair of interest points (e.g., depot, customers...), a travel-time function is known. Almost no paper investigates how these functions can be computed from travel times in the underlying road network. Furthermore, most of them neglect the possibility that different paths could be selected in the road network depending on the compromises they offer between cost (distance) and travel-time. In this presentation, we propose the first exact solution approach for these problems that starts from travel-time function expressed at the level of the road network. Computational study carried out on realistic instances and on instances derived from a real road-network illustrate the important impact of the proposed modeling on solution values.

Online user: 1 RSS Feed