A dial-a-ride problem for client transportation in a health-care organization

被引:95
作者
Melachrinoudis, Emanuel
Ilhan, Ahmet B.
Min, Hokey
机构
[1] Univ Louisville, UPS Ctr World Wide Suppy Chain Management, Louisville, KY 40292 USA
[2] Northeastern Univ, Dept Mech & Ind Engn, Boston, MA 02115 USA
关键词
D O I
10.1016/j.cor.2005.03.024
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We propose a double request dial-a-ride model with soft time windows and its application to the CAB Health and Recovery Services, Inc., a non-profit organization in the Boston Metropolitan area for the purpose of addressing the CAB clients' transportation needs. The objective of the proposed model is to minimize a convex combination of total vehicle transportation costs and total clients' inconvenience time. The latter consists of excess riding time, early/late delivery time before service and late pickup time after service. The proposed model was used to compare the benefits of coordination and central dispatching over the current system under which individual centers of the organization schedule their own clients' appointments and route their own vehicles. (c) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码:742 / 759
页数:18
相关论文
共 30 条
[1]  
[Anonymous], 1976, ADV DIAL RIDE ALGORI
[2]  
Assad A. A, 1988, VEHICLE ROUTING METH, P7
[3]   Solving vehicle routing problems using constraint programming and metaheuristics [J].
Backer, BD ;
Furnon, V ;
Shaw, P ;
Kilby, P ;
Prosser, P .
JOURNAL OF HEURISTICS, 2000, 6 (04) :501-523
[4]   A parallel tabu search heuristic for the vehicle routing problem with time windows [J].
Badeau, P ;
Guertin, F ;
Gendreau, M ;
Potvin, JY ;
Taillard, E .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 1997, 5 (02) :109-122
[5]   Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing [J].
Baugh, JW ;
Kakivaya, GKR ;
Stone, JR .
ENGINEERING OPTIMIZATION, 1998, 30 (02) :91-123
[6]  
BRAYSY O, A01022 STF42 SINTEF
[7]  
Colorni A., 2001, International Transactions in Operational Research, V8, P155, DOI 10.1111/1475-3995.00256
[8]  
CORDEAU JF, 2003, Q J BELGIAN FRENCH I, V1, P89
[9]  
DENIZ HB, 2004, THESIS NE U BOSTON M
[10]   A CLASSIFICATION SCHEME FOR VEHICLE-ROUTING AND SCHEDULING PROBLEMS [J].
DESROCHERS, M ;
LENSTRA, JK ;
SAVELSBERGH, MWP .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 46 (03) :322-332