Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/17947
Title: Shortest path finding problem in stochastic time-dependent road networks with stochastic first-in-first-out property
Authors: Chen, BY
Lam, WHK 
Li, Q
Sumalee, A
Yan, K
Keywords: Least expected time path
Shortest path problem
Stochastic first-in-first-out (S-FIFO)
Stochastic time-dependent (STD) network
Issue Date: 2013
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on intelligent transportation systems, 2013, v. 14, no. 4, 6558783, p. 1907-1917 How to cite?
Journal: IEEE transactions on intelligent transportation systems 
Abstract: 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.
URI: http://hdl.handle.net/10397/17947
ISSN: 1524-9050
EISSN: 1558-0016
DOI: 10.1109/TITS.2013.2270282
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

30
Last Week
0
Last month
3
Citations as of Nov 9, 2018

WEB OF SCIENCETM
Citations

26
Last Week
0
Last month
1
Citations as of Nov 17, 2018

Page view(s)

59
Last Week
1
Last month
Citations as of Nov 12, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.