TY - GEN
T1 - A Reliability-based Safest-path-finding Algorithm in Congested Road Networks with Travel Time Uncertainties
AU - Teng, Wenxin
AU - Lam, William H.K.
AU - Tam, Mei Lam
AU - Ma, Wei
N1 - Funding Information:
*Research supported by grants from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. PolyU R5029-18) and the Research Committee of the Hong Kong Polytechnic University (Project No. G-SB3P).
Publisher Copyright:
© 2022 IEEE.
PY - 2022/11
Y1 - 2022/11
N2 - Due to traffic demand fluctuation, travel time and accident risk are stochastic in congested road networks. In these situations, many travelers consider not only travel time reliability, but also traffic safety when choosing routes. In this study, we propose a reliability-based safest-path-finding algorithm that takes into account both traffic safety and travel time reliability. The reliability-based safest-path-finding problem is formulated by maximizing the traffic safety index while ensuring that the path travel time satisfies both a specified travel time budget and a given on-time arrival probability. The traffic safety index is defined as the time to avoid a collision with the front vehicle traveling on the same road. An efficient solution algorithm is proposed to solve the formulated problem. A case study using real-world data in Hong Kong validates the proposed algorithm.
AB - Due to traffic demand fluctuation, travel time and accident risk are stochastic in congested road networks. In these situations, many travelers consider not only travel time reliability, but also traffic safety when choosing routes. In this study, we propose a reliability-based safest-path-finding algorithm that takes into account both traffic safety and travel time reliability. The reliability-based safest-path-finding problem is formulated by maximizing the traffic safety index while ensuring that the path travel time satisfies both a specified travel time budget and a given on-time arrival probability. The traffic safety index is defined as the time to avoid a collision with the front vehicle traveling on the same road. An efficient solution algorithm is proposed to solve the formulated problem. A case study using real-world data in Hong Kong validates the proposed algorithm.
KW - on-time arrival probability
KW - path-finding
KW - safest path
KW - traffic safety
KW - travel time reliability
UR - http://www.scopus.com/inward/record.url?scp=85141824943&partnerID=8YFLogxK
U2 - 10.1109/ITSC55140.2022.9922412
DO - 10.1109/ITSC55140.2022.9922412
M3 - Conference article published in proceeding or book
AN - SCOPUS:85141824943
T3 - IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC
SP - 537
EP - 541
BT - 2022 IEEE 25th International Conference on Intelligent Transportation Systems, ITSC 2022
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 25th IEEE International Conference on Intelligent Transportation Systems, ITSC 2022
Y2 - 8 October 2022 through 12 October 2022
ER -