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

被引：199

作者：

Cordeau, Jean-Francois ^{[1
]}

Laporte, Gilbert ^{[1
]}

机构：

[1] GERAD HEC Montreal, 3000 Chemin Cote St Catherine, Montreal, PQ H3T 2A7, Canada

来源：

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH | 2003年 / 1卷 / 02期

基金：

加拿大自然科学与工程研究理事会;

关键词：

dial-a-ride problem; survey; static and dynamic pick-up and delivery problems;

D O I：

10.1007/s10288-002-0009-8

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：89 / 101

页数：13

共 30 条

[1] BORNDORFER R, 1997, 9723 SC KONR ZUS ZEN
[2] Brotcorne L, 2002, EUROPEAN J OPERATION
[3] Colorni A, 2002, APPROXIMATION UNPUB
[4] A unified tabu search heuristic for vehicle routing problems with time windows
Cordeau, JF
Laporte, G
Mercier, A
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2001, 52 (08) : 928 - 936
[5] Desaulniers G, 2002, SIAM MONOG DISCR MAT, P225
[6] Desrosiers J., 1986, American Journal of Mathematical and Management Sciences, V6, P301
[7] Desrosiers J, 1995, Handbooks in operations research and management science, V8, P35
[8] Desrosiers J, 1991, LES CAHIERS DU GERAD
[9] Dumas Y, 1989, LES CAHIERS DU GERAD
[10] Scheduling dial-a-ride paratransit under time-varying, stochastic congestion
Fu, LP
[J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2002, 36 (06) : 485 - 506

← 1 2 3 →