Sciweavers

NETWORKS
2007
13 years 11 months ago
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
Stefan Ropke, Jean-François Cordeau, Gilber...
OR
2006
Springer
13 years 11 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 ...
Anke Fabri, Peter Recht