Dynamic routing under recurrent and non-recurrent congestion using real-time ITS information

被引:55
作者
Guener, Ali R. [1 ]
Murat, Alper [1 ]
Chinnam, Ratna Babu [1 ]
机构
[1] Wayne State Univ, Dept Ind & Mfg Engn, Detroit, MI 48202 USA
关键词
JIT logistics; Transportation; Congestion; Incidents; Dynamic routing; ITS; SHORTEST-PATH PROBLEM; LOOPLESS PATHS; DURATION; NETWORKS; DELAYS;
D O I
10.1016/j.cor.2011.04.012
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In just-in-time (JIT) manufacturing environments, on-time delivery is a key performance measure for dispatching and routing of freight vehicles. Growing travel time delays and variability, attributable to increasing congestion in transportation networks, are greatly impacting the efficiency of JIT logistics operations. Recurrent and non-recurrent congestion are the two primary reasons for delivery delay and variability. Over 50% of all travel time delays are attributable to non-recurrent congestion sources such as incidents. Despite its importance, state-of-the-art dynamic routing algorithms assume away the effect of these incidents on travel time. In this study, we propose a stochastic dynamic programming formulation for dynamic routing of vehicles in non-stationary stochastic networks subject to both recurrent and non-recurrent congestion. We also propose alternative models to estimate incident induced delays that can be integrated with dynamic routing algorithms. Proposed dynamic routing models exploit real-time traffic information regarding speeds and incidents from Intelligent Transportation System (ITS) sources to improve delivery performance. Results are very promising when the algorithms are tested in a simulated network of South-East Michigan freeways using historical data from the MITS Center and Traffic.com. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码:358 / 373
页数:16
相关论文
共 52 条
  • [1] Al-Deek H.M., 1995, Transportation Research Record 1494, Transportation Research Board, P30
  • [2] Dynamic shortest path in stochastic dynamic networks: Ship routing problem
    Azaron, A
    Kianfar, F
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 144 (01) : 138 - 156
  • [3] A heuristic search approach for a nonstationary stochastic shortest path problem with terminal cost
    Bander, JL
    White, CC
    [J]. TRANSPORTATION SCIENCE, 2002, 36 (02) : 218 - 230
  • [4] Modeling traffic flow interrupted by incidents
    Baykal-Guersoy, M.
    Xiao, W.
    Ozbay, K.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 195 (01) : 127 - 138
  • [5] Bertsekas D., 2001, Dynamic Programming and Optimal Control, Two Volume Set
  • [6] AN ANALYSIS OF STOCHASTIC SHORTEST-PATH PROBLEMS
    BERTSEKAS, DP
    TSITSIKLIS, JN
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 1991, 16 (03) : 580 - 595
  • [7] A stochastic dynamic traveling salesman problem with hard time windows
    Chang, Tsung-Sheng
    Wan, Yat-wah
    Ooi, Wei Tsang
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 198 (03) : 748 - 759
  • [8] Cohen H., 1999, J TRANSPORTATION STA, V2, P123
  • [9] Dijkstra E. W., 1959, Numerische Mathematik, V1, P269, DOI [10.1007/BF01386390, DOI 10.1007/BF01386390]
  • [10] PATH PREFERENCES AND OPTIMAL PATHS IN PROBABILISTIC NETWORKS
    EIGER, A
    MIRCHANDANI, PB
    SOROUSH, H
    [J]. TRANSPORTATION SCIENCE, 1985, 19 (01) : 75 - 84