Efficiency of the Shortest Path Problem in Huge Amount of Road Data
海量道路数据下的最短路径规划效率

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.