Analysis and Discussion of the Shortest Path Algorithms for Transportation Networks
Zhaoyun Zhang · Journal of Institute of Surveying and Mapping · 2005
According to characteristics and requirements of transportation networks, this paper introduces some classical shortest path algorithms and data store model suitable for road networks, 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.