Vehicle routing with dynamic travel times: A queueing approach

被引:114
作者
Van Woensel, T. [1 ]
Kerbache, L. [2 ]
Peremans, H. [3 ]
Vandaele, N. [4 ]
机构
[1] Eindhoven Univ Technol, TUle, NL-5600 MB Eindhoven, Netherlands
[2] HEC Sch Management, Paris, France
[3] Univ Antwerp, B-2020 Antwerp, Belgium
[4] Catholic Univ Louvain, B-3000 Louvain, Belgium
关键词
vehicle scheduling; dynamic travel times; queueing;
D O I
10.1016/j.ejor.2007.03.012
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Transportation is an important component of supply chain competitiveness since it plays a major role in the inbound, inter-facility, and outbound logistics. In this context, assigning and scheduling vehicle routes is a crucial management problem. In this paper, a vehicle routing problem with dynamic travel times due to potential traffic congestion is considered. The approach developed introduces mainly the traffic congestion component based on queueing theory. This is an innovative modeling scheme to capture travel times. The queueing approach is compared with other approaches and its potential benefits are described and quantified. Moreover, the optimization of the starting times of a route at the distribution center is evaluated. Finally, the trade-off between solution quality and calculation time is discussed. Numerous test instances are used, both to illustrate the appropriateness of the approach as well as to show that time-independent solutions are often unrealistic within a congested traffic environment, which is usually the case on European road networks. (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:990 / 1007
页数:18
相关论文
共 41 条
[1]  
AARTS E, 1997, LOCAL SEARCH COMBINA
[2]  
AKCELIK R, 1996, TRAFFIC ENG CONTROL, V37, P511
[3]  
Akcelik R., 2000, Aust. Road Res., V21, P49
[4]   Separating capacity constraints in the CVRP using tabu search [J].
Augerat, P ;
Belenguer, JM ;
Benavent, E ;
Corberan, A ;
Naddef, D .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 106 (2-3) :546-557
[5]   A new generation of vehicle routing research: Robust algorithms, addressing uncertainty [J].
Bertsimas, DJ ;
SimchiLevi, D .
OPERATIONS RESEARCH, 1996, 44 (02) :286-304
[6]   STOCHASTIC AND DYNAMIC VEHICLE-ROUTING WITH GENERAL DEMAND AND INTERARRIVAL TIME DISTRIBUTIONS [J].
BERTSIMAS, DJ ;
VANRYZIN, G .
ADVANCES IN APPLIED PROBABILITY, 1993, 25 (04) :947-978
[7]   STOCHASTIC AND DYNAMIC VEHICLE-ROUTING IN THE EUCLIDEAN PLANE WITH MULTIPLE CAPACITATED VEHICLES [J].
BERTSIMAS, DJ ;
VANRYZIN, G .
OPERATIONS RESEARCH, 1993, 41 (01) :60-76
[8]   A STOCHASTIC AND DYNAMIC VEHICLE-ROUTING PROBLEM IN THE EUCLIDEAN PLANE [J].
BERTSIMAS, DJ ;
VANRYZIN, G .
OPERATIONS RESEARCH, 1991, 39 (04) :601-615
[9]   REAL-TIME, WIDE AREA DISPATCH OF MOBIL TANK TRUCKS [J].
BROWN, GG ;
ELLIS, CJ ;
GRAVES, GW ;
RONEN, D .
INTERFACES, 1987, 17 (01) :107-120
[10]  
Coyle J. J., 1996, The Management of Business Logistics