Sciweavers

Share
IJCAI
2007

Waiting and Relocation Strategies in Online Stochastic Vehicle Routing

8 years 8 months ago
Waiting and Relocation Strategies in Online Stochastic Vehicle Routing
This paper considers online stochastic multiple vehicle routing with time windows in which requests arrive dynamically and the goal is to maximize the number of serviced customers. Contrary to earlier algorithms which only move vehicles to known customers, this paper investigates waiting and relocation strategies in which vehicles may wait at their current location or relocate to arbitrary sites. Experimental results show that waiting and relocation strategies may dramatically improve customer service, especially for problems that are highly dynamic and contain many late requests. The decisions to wait and to relocate do not exploit any problem-specific features but rather are obtained by including choices in the online algorithm that are necessarily sub-optimal in an offline setting.
Russell Bent, Pascal Van Hentenryck
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2007
Where IJCAI
Authors Russell Bent, Pascal Van Hentenryck
Comments (0)
books