Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6936918 | Transportation Research Part C: Emerging Technologies | 2014 | 18 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Duygu TaÅ, Nico Dellaert, Tom van Woensel, Ton de Kok,