Analysis of shortest path algorithms for transportation networks
Xu Zhi · 2005
According to characteristics of the transportation networks, some classical shortest path algorithms and data storage model suitable for road networks are introduced, and several special problems which need to be treated in the routing planning for the arteries of communication, such as the intersection delay and the forbidden state in road networks, are discussed, and the corresponding solutions are given theoretically. Finally, a path search example is given.