The Dial-a-Ride Problem: Models and Algorithms


BibTeX reference

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.

, 26 pages

Research Axis

Research application


The dial-a-ride problem: Models and algorithms
Annals of Operations Research, 153(1), 29–46, 2007 BibTeX reference