Article ID: | iaor20083277 |
Country: | Netherlands |
Volume: | 153 |
Issue: | 1 |
Start Page Number: | 29 |
End Page Number: | 46 |
Publication Date: | Sep 2007 |
Journal: | Annals of Operations Research |
Authors: | Laporte Gilbert, Cordeau Jean-Franois |
Keywords: | vehicle routing & scheduling |
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.