Sciweavers

COR
2010

The multi-shift vehicle routing problem with overtime

13 years 11 months ago
The multi-shift vehicle routing problem with overtime
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repeatedly to serve demand over a planning horizon of several days. The vehicles usually take long trips and there are significant demands near shift changes. The problem is inspired by a routing problem in healthcare, where the vehicles continuously operate in shifts, and overtime is allowed. We study whether the tradeoff between overtime and other operational costs such as travel cost, regular driver usage, and cost of unmet demands can lead to a more efficient solution. We develop a shift dependent (SD) heuristic that takes overtime into account when constructing routes. We show that the SD algorithm has significant savings in total cost as well as the number of vehicles over constructing the routes independently in each shift, in particular when demands are clustered or non-uniform. Lower bounds are obtained ...
Yingtao Ren, Maged M. Dessouky, Fernando Ord&oacut
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2010
Where COR
Authors Yingtao Ren, Maged M. Dessouky, Fernando Ordóñez
Comments (0)