Séance TA6 - Tournées de véhicules avec fenêtres de temps / Vehicle Routing with Time Windows
Jour mardi, le 05 mai 2009 Salle Mary Husny Président Jean-Yves Potvin
Présentations
|
10h30- 10h55 |
Reliability in Vehicle Routing with Time Windows |
|
Tom Van Woensel, Eindhoven University of Technology, Industrial Engineering, Den Dolech 2, Eindhoven, Eindhoven, The Netherlands, 5600MB This paper deals with time-dependent travel times as the vehicles operate in a congested traffic network. We consider stochastic travel time distributions, analyze the propagation through the network and the interplay with the customer's time windows. The value of using these distributions in VRPTW is discussed and demonstrated on a number of instances. |
|
10h55- 11h20 |
Split Delivery Vehicle Routing with Time Windows: An Improved Branch-Price-and-Cut Method |
|
Guy Desaulniers, GERAD, École Polytechnique de Montréal, Mathématiques et génie industriel, C.P. 6079, Succ. Centre-ville, Montréal, Québec, Canada, H3C 3A7 Claudia Archetti, University of Brescia, Quantitative Methods, Contrada Santa Chiara, 50, Brescia, Italy, 25122 Very recently, Desaulniers (2008) proposed a new exact branch-price-and-cut method for the split delivery vehicle routing problem with time windows. In this talk, we present enhancements to this method that accelerate the search for negative reduced cost columns and improve the lower bounds. Computational results will be reported. |
|
11h20- 11h45 |
Drivers' Rules in Vehicle Routing with Time Windows |
|
Éric Prescott-Gagnon, GERAD, École Polytechnique de Montréal, Mathématiques et génie industriel, Montréal, Québec, Canada, H3C 3A7 Guy Desaulniers, GERAD, École Polytechnique de Montréal, Mathématiques et génie industriel, C.P. 6079, Succ. Centre-ville, Montréal, Québec, Canada, H3C 3A7 Louis-Martin Rousseau, École Polytechnique de Montréal, MAGI et CIRRELT, C.P. 6079, Succ. Centre-ville, Montréal, Québec, Canada, H3C 3A7 Jens Wollenweber, Fraunhofer Institute, Nordostpark 93, Nuremberg, Germany, 90411 We address a variant of the vehicle routing problem with time windows that considers most of the European drivers' regulations. For this variant, we develop a large neighborhood search method that relies on column generation to evaluate a neighborhood. Computational results will be reported. |
|
11h45- 12h10 |
Adaptive Large Neighborhood Search for a Vehicle Routing Problem with Time Windows and Multiple Trips |
|
Nabila Azi, Université de Montréal, Informatique et recherche opérationnelle, C.P. 6128, succ. Centre-Ville, Montréal, Québec, Canada, H3C 3J7 Michel Gendreau, Université de Montréal, Informatique et recherche opérationnelle, Succ. Centre-ville, Montréal, Québec, Canada, H3C 3J7 Jean-Yves Potvin, Université de Montréal, Informatique et recherche opérationnelle, C.P. 6128, succ. Centre-Ville, Montréal, Québec, Canada, H3C 3J7 We present an adaptive large neighborhood search for a vehicle routing problem with time windows and multiple trips. This problem is motivated from applications where the duration of each vehicle route is limited due, for example, to the transportation of perishable goods. Computational results on Euclidean problems derived from well-known benchmark instances are reported. |