Travel Time Estimation in Vehicle Routing Problem

被引:0
作者
Kim, G. [1 ]
机构
[1] Hanbat Natl Univ, Dept Ind Management Engn, Deajeon, South Korea
来源
2017 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM) | 2017年
基金
新加坡国家研究基金会;
关键词
Vehicle Routing Problem; Travel Time; City Vehicle Routing; REAL-TIME; INFORMATION; NETWORKS;
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Vehicle routing is a well-known problem in operations research. The problem aims to find an optimal route for vehicles touring all customer locations. Travel time is one of objectives in vehicle routing problem(VRP). The travel time of a route is the sum of travel times between two customers in the route. In reality, there are multiple road segments between two customer sites. Thus, probability distribution of travel time between two customers can be derived by the convolution of distributions of road segments within the arc of two locations. This paper suggests a method of estimation of travel time of the arc in the network of VRP. An example addresses how the method applies to estimate the distribution of the travel time.
引用
收藏
页码:1004 / 1008
页数:5
相关论文
共 11 条
[1]   SHORTEST ROUTE THROUGH A NETWORK WITH TIME-DEPENDENT INTERNODAL TRANSIT TIMES [J].
COOKE, KL ;
HALSEY, E .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1966, 14 (03) :493-&
[2]   The impacts of congestion on commercial vehicle tour characteristics and costs [J].
Figliozzi, Miguel Andres .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2010, 46 (04) :496-506
[3]   Dynamic vehicle routing based on online traffic information [J].
Fleischmann, B ;
Gnutzmann, S ;
Sandvoss, E .
TRANSPORTATION SCIENCE, 2004, 38 (04) :420-433
[4]   Expected shortest paths in dynamic and stochastic traffic networks [J].
Fu, LP ;
Rilett, LR .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1998, 32 (07) :499-516
[5]   Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks [J].
Gao, Song ;
Huang, He .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2012, 21 (01) :196-213
[6]   Interval travel times for more reliable routing in city logistics [J].
Gross, Patrick-Oliver ;
Geisinger, Michael ;
Ehmke, Jan Fabian ;
Mattfeld, Dirk Christian .
NINTH INTERNATIONAL CONFERENCE ON CITY LOGISTICS, 2016, 12 :239-251
[7]   Dynamic routing under recurrent and non-recurrent congestion using real-time ITS information [J].
Guener, Ali R. ;
Murat, Alper ;
Chinnam, Ratna Babu .
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (02) :358-373
[8]   THE FASTEST PATH THROUGH A NETWORK WITH RANDOM TIME-DEPENDENT TRAVEL-TIMES [J].
HALL, RW .
TRANSPORTATION SCIENCE, 1986, 20 (03) :182-188
[9]   Solving the Dynamic Vehicle Routing Problem Under Traffic Congestion [J].
Kim, Gitae ;
Ong, Yew Soon ;
Cheong, Taesu ;
Tan, Puay Siew .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2016, 17 (08) :2367-2380
[10]   Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem [J].
Schilde, M. ;
Doerner, K. F. ;
Hartl, R. F. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 238 (01) :18-30