Journal
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS
Volume 14, Issue 4, Pages 1907-1917Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TITS.2013.2270282
Keywords
Least expected time path; shortest path problem; stochastic first-in-first-out (S-FIFO); stochastic time-dependent (STD) network
Categories
Funding
- National Science Foundation of China [41231171, 41201466, 41071285, 41021061]
- National High-Tech Research and Development Program of China [2012AA12A211]
- Shenzhen Scientific Research and Development Funding Program [ZDSY20121019111146499]
- Shenzhen Dedicated Funding of Strategic Emerging Industry Development Program [JCYJ20121019111128765]
- China Postdoctoral Science Foundation [2012M521469, 2013T60741]
- Research Grants Council of the Hong Kong Special Administrative Region [PolyU 5196/10E]
Ask authors/readers for more resources
As travel times in road networks are dynamic and uncertain, it is difficult and time-consuming to search for the least expected time path in large-scale networks. This paper addresses the problem of finding the least expected time path in stochastic time-dependent (STD) road networks. A stochastic travel speed model is proposed to represent STD link travel times. It is proved that the link travel times in STD networks satisfy the stochastic first-in-first-out (S-FIFO) property. Based on this S-FIFO property, an efficient multicriteria A* algorithm is proposed to exactly determine the least expected time path in STD networks. Computational results using several large-scale road networks show that the proposed algorithm has a significant computational advantage over existing solution algorithms without the S-FIFO property.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available