Sciweavers

Share
OR
2006
Springer

Online Dial-A-Ride Problem with Time Windows: An Exact Algorithm Using Status Vectors

11 years 6 months ago
Online Dial-A-Ride Problem with Time Windows: An Exact Algorithm Using Status Vectors
The Dial-A-Ride Problem (DARP) has often been used to organize transport of elderly and handicapped people, assuming that these people can book their transport in advance. But the DARP can also be used to organize usual passenger or goods transportation in real online scenarios with time window constraints. This paper presents an efficient exact algorithm with significantly reduced calculation times.
Anke Fabri, Peter Recht
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2006
Where OR
Authors Anke Fabri, Peter Recht
Comments (0)
books