Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/27358
Title: Using a multi-criteria approach to solve path finding problem in road networks with uncertainty
Authors: Chen, BY
Lam, WHK 
Tam, ML
Issue Date: 2008
Source: Proceedings of the 13th International Conference of Hong Kong Society for Transportation Studies: Transportation and Management Science, 2008, p. 229-238 How to cite?
Abstract: It was empirically found that travelers would make their route choice not only based on travel time saving but also on reduction of travel cost and travel time variability. However, little attention has been given to determine optimal reliable shortest path (RSP) in stochastic network effectively and efficiently. This paper investigates the stochastic reliable shortest path problem (SRSPP) in road networks with travel time uncertainty and toll charges. Based on the chance-constrained model formulation, the SRSPP is formulated as an equivalent multi-criteria shortest path problem (MSPP) in this paper. A reliable shortest path algorithm (RSPA) is proposed to solve the SRSPP. A numerical example is used to demonstrate the performance of the proposed algorithm. Comparison is made by using the conventional label correcting approach (LCA) for solving the MSPP. The computational results indicate that the proposed RSPA is much efficient than LCA for finding the optimal RSP in Hong Kong road network.
Description: 13th International Conference of Hong Kong Society for Transportation Studies: Transportation and Management Science, Kowloon, 13-15 December 2008
URI: http://hdl.handle.net/10397/27358
ISBN: 9789889884734
Appears in Collections:Conference Paper

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

SCOPUSTM   
Citations

1
Last Week
0
Last month
Citations as of Oct 16, 2017

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
0
Citations as of Oct 17, 2017

Page view(s)

48
Last Week
1
Last month
Checked on Oct 15, 2017

Google ScholarTM

Check



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