This study aims to find an experientially reliable path considering travel time uncertainty and driving experience of local probe vehicle drivers. Accordingly, a two‐stage route‐finding procedure is proposed. First, a set of candidate paths is built by using the hyperpath algorithm, where the choice probability is assigned to each link with uncertain travel time. Second, the shortest path algorithm is applied to find the experientially reliable path on the graph of hyperpath where the modified link cost is penalised based on the link choice probability derived from hyperpath algorithm and the driving experience of local drivers. Four kinds of optimal path in a real‐world network are compared with the observed one. It is found that the proposed path has the most similarity with the observed path and it has a higher degree of familiarity and reasonable time and distance.
Application of hyperpath strategy and driving experience to risk‐averse navigation
IET Intelligent Transport Systems ; 10 , 5 ; 338-346
2016-06-01
9 pages
Article (Journal)
Electronic Resource
English
hyperpath algorithm , risk‐averse navigation , two‐stage route‐finding procedure , driving experience , navigation , real‐world network , probability , penalised modified link cost , network theory (graphs) , shortest path algorithm , link choice probability , travel time uncertainty , local probe vehicle drivers , vehicle routing
Application of hyperpath strategy and driving experience to risk-averse navigation
IET | 2016
|Faster hyperpath generating algorithms for vehicle navigation
Taylor & Francis Verlag | 2013
|9 HYPERPATH FORMULATIONS OF TRAFFIC ASSIGNMENT PROBLEMS
British Library Conference Proceedings | 1998
|Estimating Weights of Times and Transfers for Hyperpath Travelers
Online Contents | 2012
|Risk-Averse Equilibria for Vehicle Navigation in Stochastic Congestion Games
IEEE | 2022
|