The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and schedules for n users who specify pickup and delivery requests between origins and destinations. The aim is to plan a set of m minimum cost vehicle routes capable of accommodating as many users as possible, under a set of constraints. The most common example arises in door-to-door transportation for elderly or disabled people. The purpose of this article is to review the scientific literature on the DARP. The main features of the problem are described and a summary of the most important models and algorithms is provided.
The dial-a-ride problem: models and algorithms
Ann Oper Res
Annals of Operations Research ; 153 , 1 ; 29-46
2007-09-01
18 pages
Article (Journal)
Electronic Resource
English
Scheduling Algorithms for a Dial-A-Ride System
NTIS | 1971
|Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem
Online Contents | 2011
|British Library Conference Proceedings | 1993
|