Using a multi-criteria approach to solve path finding problem in road networks with uncertainty

Bi Yu Chen, Hing Keung William Lam, Mei Lam Tam

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

2 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings of the 13th International Conference of Hong Kong Society for Transportation Studies
Subtitle of host publicationTransportation and Management Science
Pages229-238
Number of pages10
Publication statusPublished - 1 Dec 2008
Event13th International Conference of Hong Kong Society for Transportation Studies: Transportation and Management Science - Kowloon, Hong Kong
Duration: 13 Dec 200815 Dec 2008

Conference

Conference13th International Conference of Hong Kong Society for Transportation Studies: Transportation and Management Science
CountryHong Kong
CityKowloon
Period13/12/0815/12/08

ASJC Scopus subject areas

  • Transportation

Cite this