A Multi-Path Astar Algorithm for Recognizing Reasonable Route Set
Wei Yin, Xiaoguang Yang · 2012
The reasonable route set is defined as a set of all paths which drivers may be selected from in a specific OD pair. This is a necessary link in traffic assignments and it is also an important determining factor for traffic management and control. So there is interest in algorithms that can deliver multi-paths that may be reasonable. In this paper, an efficient Astar-based algorithm is designed to elect such route set. Compared with conventional Dijkstra-based one, it runs faster and gets suboptimal results in the early stage of calculation. A numerical example demonstrates the operation of the algorithm.