The Dial-a-Ride Problem (DARP): Variants, modelling issues and algorithms

The Dial-a-Ride Problem (DARP): Variants, modelling issues and algorithms

0.00 Avg rating0 Votes
Article ID: iaor2005984
Country: Germany
Volume: 1
Issue: 2
Start Page Number: 89
End Page Number: 101
Publication Date: Jan 2003
Journal: 4OR
Authors: ,
Keywords: vehicle routing & scheduling, urban affairs
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.

Reviews

Required fields are marked *. Your email address will not be published.