A tabu search heuristic for the static multi-vehicle dial-a-ride problem

被引：459
作者：
Cordeau, JF
Laporte, G
机构：
[1] HEC Montreal, Canada Res Chair Distribut Management, Montreal, PQ H3T 2A7, Canada
[2] HEC Montreal, Gerad, Montreal, PQ H3T 2A7, Canada
来源：
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL | 2003年 / 37卷 / 06期
基金：
加拿大自然科学与工程研究理事会;
关键词：
dial-a-ride problem; door-to-door transportation; tabu search heuristic;
D O I：
10.1016/S0191-2615(02)00045-0
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
This article describes a tabu search heuristic for the dial-a-ride problem with the following characteristics. Users specify transportation requests between origins and destinations. They may provide a time window on their desired departure or arrival time. Transportation is supplied by a fleet of vehicles based at a common depot. The aim is to design a set of least cost vehicle routes capable of accommodating all requests. Side constraints relate to vehicle capacity, route duration and the maximum ride time of any user. Extensive computational results are reported on randomly generated and real-life data sets. (C) 2003 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码：579 / 594
页数：16
相关论文
共 31 条
[1]  
[Anonymous], 1997, TABU SEARCH
[2]  
BODIN LD, 1986, TIMS STUDIES MANAGEM, V26, P73
[3]  
BORNDORFER R, 1997, 9723 SC
[4]   A unified tabu search heuristic for vehicle routing problems with time windows [J].
Cordeau, JF ;
Laporte, G ;
Mercier, A .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2001, 52 (08) :928-936
[5]  
Cordeau JF, 1997, NETWORKS, V30, P105, DOI 10.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO
[6]  
2-G
[7]  
CORDEAU JF, 2002, IN PRESS Q J BELGIAN
[8]  
Desaulniers G., 2002, SIAM MONOGRAPHS DISC
[9]  
Desrosiers J., 1986, American Journal of Mathematical and Management Sciences, V6, P301
[10]  
DESROSIERS J, 1991, G9122 GERAD EC HAUT
1234