Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The dial-a-ride problem: models and algorithms

The dial-a-ride problem: models and algorithms 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Operations Research Springer Journals

The dial-a-ride problem: models and algorithms

Loading next page...
 
/lp/springer-journals/the-dial-a-ride-problem-models-and-algorithms-tS5IEWJSwc

References (47)

Publisher
Springer Journals
Copyright
Copyright © 2007 by Springer Science+Business Media, LLC
Subject
Business and Management; Operation Research/Decision Theory; Combinatorics; Theory of Computation
ISSN
0254-5330
eISSN
1572-9338
DOI
10.1007/s10479-007-0170-8
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Annals of Operations ResearchSpringer Journals

Published: May 5, 2007

There are no references for this article.