The time-dependent vehicle routing problem with soft time windows and stochastic travel times |
| |
| Institution: | 1. Canada Research Chair in Distribution Management, HEC Montréal, Montréal H3T 2A7, Canada;2. Panalpina Centre for Manufacturing and Logistics Research, Cardiff Business School, Cardiff University, Cardiff CF10 3EU, UK;3. Naveen Jindal School of Management, University of Texas at Dallas, Richardson, TX 75080-3021, USA;4. School of Industrial Engineering, Eindhoven University of Technology, Eindhoven 5600MB, The Netherlands;1. Operations Management, Hacettepe University, Ankara, Turkey;2. Management Science, Hacettepe University, Ankara, Turkey;3. Hacettepe University, Department of Business Administration, 06800 Beytepe, Ankara, Turkey;1. CIRRELT – Interuniversity Research Center on Enterprise Networks, Logistics and Transportation, École de Technologie Supérieure de Montréal, Canada;2. CIRRELT – Interuniversity Research Center on Enterprise Networks, Logistics and Transportation, and Département de mathématiques et génie industriel, École Polytechnique de Montréal, Canada;3. CIRRELT – Interuniversity Research Center on Enterprise Networks, Logistics and Transportation, and Département de management et de technologie, Université du Québec à Montréal, Canada;4. GERAD – Group for Research in Decision Analysis, and Département de mathématiques et génie industriel, École Polytechnique de Montréal, Canada;5. Département de génie de la construction, École de Technologie Supérieure de Montréal, Canada |
| |
| Abstract: | This paper studies a vehicle routing problem with time-dependent and stochastic travel times. In our problem setting, customers have soft time windows. A mathematical model is used in which both efficiency for service as well as reliability for customers are taken into account. Depending on whether service times are included or not, we consider two versions of this problem. Two metaheuristics are built: a Tabu Search and an Adaptive Large Neighborhood Search. We carry out our experiments for well-known problem instances and perform comprehensive analyses on the numerical results in terms of the computational time and the solution quality. Experiments confirm that the proposed procedure is effective to obtain very good solutions to be performed in real-life environment. |
| |
| Keywords: | Vehicle routing Time-dependency Stochastic travel times Time windows |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
