摘要
在智能交通的导航/动态路线诱导系统中,最短路径搜寻是其重要功能.根据城市交通路网建设的实际,研究了描述城市交通网络图的城市道路数据库的组织结构.在此数据结构的基础上依靠GIS技术的支持,采集了大量具体道路信息,采用Dijkstra算法实现了快速最短路径搜索.根据城市的交通状况对交通网络图的边值赋予不同的权值可实现最优路径搜寻.给出了在广州市电子地图上搜索的一个实例:一个包含61个交通路口的最短路径搜索结果的搜索时间约为2.2s.
In intelligent traffic navigation or dynamic path abduction systems, the shortest path searching is the basic function. According to the nature of road net of a city, the database structure describing the city road net is studied. Based on the database structure and the need of a GIS system, the road information is collected. Then Dijkstra algorithm is used to realize fast searching of the shortest path. The electronic map of Guangzhou is presented to show an example of city raod searching, the time of a shortest path searching result, which includes 61 crossings, being about 2.2 s.
出处
《西南交通大学学报》
EI
CSCD
北大核心
2003年第1期80-83,共4页
Journal of Southwest Jiaotong University
基金
中国科学院特别支持项目(KY957-09-01)
