查看文章

As an essential part of dynamic traffic assignment in time-dependent road networks, route choice set generation has been studied extensively in recent decades. The K shortest path searching algorithm has been widely used to generate the choice set with the assumption of bounded rationality. Some improved classical path searching algorithms and heuristic approaches have been proposed for the K shortest path searching, but most of them are time-consuming or in some cases, unable to find the optimal results. In this paper, a K shortest path algorithm was designed as a dual-loop framework for urban network route generation. In the framework, the A-star algorithm was used for shortest path search. Meanwhile, the link elimination approach was used as the strategy when searching for the k^th shortest path. In order to improve the efficiency of the proposed model, heuristic function in A-star algorithm was also …