应急条件下边防地区路径优化算法研究  

Research on path optimization algorithm in frontier district under emergency circumstances

作　　者：陈海松[1] 贺伟雄 楼增龙 彭永飞[1] 

机构地区：[1]解放军理工大学野战工程学院,南京210007

出　　处：《计算机工程与应用》2016年第1期33-36,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61105073)

摘　　要：边防地区道路类型的多样性对路径优化算法提出了新的要求,在道路分类的基础上,对应急条件下边防地区路径优化问题进行建模,在道路连通性的基础上提出了"投影速度"的概念,设计了一种适用于边防地区的路径优化算法。实验结果表明,与Dijkstra算法相比,该算法遍历节点数减少了70%,时间花费减少50%,通过在边防地区GIS系统中的良好应用,验证了算法的可靠性和实用性。The variety of roads in frontier district has set some new requirements to the path optimization algorithm. In emergency circumstances, the routing problem in frontier district is modeled, the concept of＂projective velocity＂is made based on the geographic relevance among roads, and a new kind of shortest path algorithm which is suitable for frontier district is designed. Compared to the Dijkstra algorithm, the experimental results show that the new algorithm traversals amount of nodes reduces 70% and the time cost decreases 50%. Applied well in the GIS for frontier district, it proves that the algorithm is practical and reliable.

关 键 词：路径优化算法 投影速度 边防地区 

分 类 号：TP319[自动化与计算机技术—计算机软件与理论]