Travel Time Reliability-based Optimal Path Finding
A heuristic solution algorithm for travel time reliability-based path rinding problem is proposed in this paper. Due to network uncertainties, the travel times are not deterministic and suffer from fluctuations. Under this circumstance, traditional optimal path methods based on least expected travel time can not capture the network users risk-taking behaviors in path finding. In reorganization of this limitation, the definition of effective travel time is introduced to take into account travel time reliability issue. Then, the optimal path defined in this paper is to find the path with minimum effective travel time. Due to the non-additive property of the effective travel time, the optimal path is difficult to find unless enumerate all the paths. To avoid path enumeration while finding the optimal path, the kshortest paths algorithm is adopted to generate a path set by iterations. This path set is generated in an attempt to include the optimal path. Then, the optimal path can be easily found in such path set. A numerical example is carried out to show the applications and efficiency of the proposed algorithm.
optimal path travel time reliability K-shortest paths algorithm
Shuopeng Wang Hu Shao Li Tao Qinjian Ni
Department of Mathematics China University of Mining and Technology Xuzhou,221116,P.R.China Department of Physics China University of Mining and Technology Xuzhou,221116,P.R.China
国际会议
黄山
英文
531-534
2010-05-28（万方平台首次上网日期，不代表论文的发表时间）