本文已被：浏览 1835次 下载 4329次
Received:December 21, 2009 Revised:January 31, 2010
Received:December 21, 2009 Revised:January 31, 2010
中文摘要: 通过内存映射完成大拓扑文件的快速加载，估价函数快速过滤无效点和路段，折线简化算法加速长路径的显示等手段，解决了海量道路数据下的最短路径规划效率问题。经比较分析与实践检验证明，规划算法的综合性能指标小于5秒，具有较好的工程应用价值。
Abstract:In huge amounts of road data, calculating the short path is time-consuming. A completed solution for improving the efficiency of Shortest Path Problem is proposed. In the solution, file-mapping, evaluation function and simplification of polylines are used for increasing huge topo file loading, filling out ineffectual data to improve Dijkstra algorithm and accelerating results. With practical experience, the system works out the problem in no more than 5 seconds.
文章编号： 中图分类号： 文献标志码：
基金项目:
| Author Name | Affiliation |
| LIU Xiao-Hui | 中国电子科技集团公司 第二十八研究所 江苏 南京 210007 |
| LU Ting |
| Author Name | Affiliation |
| LIU Xiao-Hui | 中国电子科技集团公司 第二十八研究所 江苏 南京 210007 |
| LU Ting |
引用文本：
刘晓晖,陆挺.海量道路数据下的最短路径规划效率.计算机系统应用,2010,19(9):195-198
LIU Xiao-Hui,LU Ting.Efficiency of the Shortest Path Problem in Huge Amount of Road Data.COMPUTER SYSTEMS APPLICATIONS,2010,19(9):195-198
刘晓晖,陆挺.海量道路数据下的最短路径规划效率.计算机系统应用,2010,19(9):195-198
LIU Xiao-Hui,LU Ting.Efficiency of the Shortest Path Problem in Huge Amount of Road Data.COMPUTER SYSTEMS APPLICATIONS,2010,19(9):195-198
