期刊
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
卷 97, 期 -, 页码 251-267出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.tre.2016.10.014
关键词
Milk-run; Dynamic routing; Congestion; Intelligent transportation system; TSP with hard time windows
类别
资金
- U.S. Department of Transportation
- Michigan Department of Transportation through MIOH University Transportation Center
We consider finding static yet robust recurring milk-run tours while dynamically routing the vehicle between site visits. The network arcs experience recurrent congestion, leading to stochastic and time-dependent travel times. Based on vehicle location, time of day, and current and projected network congestion states, we generate dynamic routing policies (DRP) for every pair of sites using stochastic dynamic programming (SDP). By simulating DRP we find travel time distributions for each pair of sites which is used to build the robust tour using another SDP formulation. Results are very promising when the algorithms are tested in a simulated network using historical traffic data. (C) 2016 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据