陈玉敏, 龚健雅, 史文中. 多级道路网的最优路径算法研究[J]. 武汉大学学报 ( 信息科学版), 2006, 31(1): 70-73.
引用本文: 陈玉敏, 龚健雅, 史文中. 多级道路网的最优路径算法研究[J]. 武汉大学学报 ( 信息科学版), 2006, 31(1): 70-73.
CHENYumin, GONGJianya, SHIWenzhong. Research on the Optimal Path Algorithm in Multi-Level Road Network[J]. Geomatics and Information Science of Wuhan University, 2006, 31(1): 70-73.
Citation: CHENYumin, GONGJianya, SHIWenzhong. Research on the Optimal Path Algorithm in Multi-Level Road Network[J]. Geomatics and Information Science of Wuhan University, 2006, 31(1): 70-73.

多级道路网的最优路径算法研究

Research on the Optimal Path Algorithm in Multi-Level Road Network

  • 摘要: 针对大区域道路网的最优路径问题,分析了现有算法的不足,提出了采用金字塔似的多级道路网数据模型解决大数据量的网络分析问题,论述了多级道路网的数据模型构建以及多级道路网的最优路径算法。从实例分析可以看出,该模型及算法在处理大区域道路网最优路径分析上是可行的。

     

    Abstract: The optimal path algorithms on wide range road network are reviewed and existed problems are discussed in this paper.In order to make up insufficiency of existed optimal path algorithm,the thesis proposes optimal path algorithm based on the pyramid-like multi-level road network.The design of algorithm,mathematics expression,as well as algorithm implementation are narrated.The application example is implemented to prove the efficiency and the rationality of this algorithm

     

/

返回文章
返回