交通限制条件下的最短路径算法分析与优化  

Analysis and Discussion of the Shortest Path Algorithms for Transportation Networks

作　　者：许志海[1] 张昭云[1] 

机构地区：[1]信息工程大学测绘学院,河南郑州450052

出　　处：《测绘学院学报》2005年第1期62-64,68,共4页Journal of Institute of Surveying and Mapping

摘　　要：通过对交通网络本身的特点及要求的分析与研究,介绍了一些适合道路网的经典最短路算法和数据存贮模式,探讨了在交通网络路线优化过程中需要特别处理的几个问题,如路口延误、禁行状态等,并在理论上给出了相应的解决方案。最后给出了一个路径搜索的实例。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.

关 键 词：交通网络 最短路径 Dijstra算法 启发式搜索 交通信息 

分 类 号：P282[天文地球—地图制图学与地理信息工程]