Abstract.
The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and schedules for n users who specify pick-up and drop-off 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 classified and some modeling issues are discussed. A summary of the most important algorithms is provided.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
AMS classification:
90B06, 90C27, 90C59
Rights and permissions
About this article
Cite this article
Cordeau, JF., Laporte, G. The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms. 4OR 1, 89–101 (2003). https://doi.org/10.1007/s10288-002-0009-8
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s10288-002-0009-8