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.
Original language | English |
---|---|
Title of host publication | Proceedings of the 13th International Conference of Hong Kong Society for Transportation Studies |
Subtitle of host publication | Transportation and Management Science |
Pages | 229-238 |
Number of pages | 10 |
Publication status | Published - 1 Dec 2008 |
Event | 13th International Conference of Hong Kong Society for Transportation Studies: Transportation and Management Science - Kowloon, Hong Kong Duration: 13 Dec 2008 → 15 Dec 2008 |
Conference
Conference | 13th International Conference of Hong Kong Society for Transportation Studies: Transportation and Management Science |
---|---|
Country/Territory | Hong Kong |
City | Kowloon |
Period | 13/12/08 → 15/12/08 |
ASJC Scopus subject areas
- Transportation