Join or Log in
In this thesis we develop two heuristic algorithms for large-scale multi-vehicle advance-request version of the dial-a-ride problem. This problem is concerned with developing a set of routes for a fleet of vehicles serving customers who have to be picked up from specified origins and be delivered to specified destinations.
DSpace@MIT: Solving large-scale dial-a-ride vehicle routing and scheduling problems 
Added 2 years ago by Francis Tseng
Show info
DSpace@MIT: Solving large-scale dial-a-ride vehicle routing and scheduling problems 
Info
In this thesis we develop two heuristic algorithms for large-scale multi-vehicle advance-request version of the dial-a-ride problem. This problem is concerned with developing a set of routes for a fleet of vehicles serving customers who have to be picked up from specified origins and be delivered to specified destinations.
1 Connection