Journal
ANNALS OF OPERATIONS RESEARCH
Volume 153, Issue 1, Pages 29-46Publisher
SPRINGER
DOI: 10.1007/s10479-007-0170-8
Keywords
dial-a-ride problem; survey; static and dynamic pickup and delivery problems
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available