Variable Neighborhood Search for the Time-Dependent Vehicle Routing Problem with Soft Time Windows
In this paper we present a variable neighborhood search for time-dependent vehicle routing problems with time windows. Unlike the well-studied routing problems with constant travel times, in the time-dependent case the travel time depends on the time of the day. This assumption approaches reality, in particular for urban areas where travel times typically vary during the day, e.g., because of traffic congestion due to rush hours. An experimental evaluation for the vehicle routing problem with soft time windows with and without time-dependent travel times is performed and it is shown that taking time-dependent travel times into account provides substantial improvements of the considered objective function.
KeywordsVehicle routing problem time-dependent travel times time windows variable neighborhood search
Unable to display preview. Download preview PDF.
- 5.Hansen, P., Mladenović, N.: Variable Neighborhood Search. In: Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Applied Optimization, pp. 221–234. Oxford University Press, New York (2000)Google Scholar