摘要
以森林防火中的路径分析算法为研究对象,针对森林防火中对路径分析算法的特殊要求,以Dijkstra最短路径算法为基础,对它们进行改进与优化。结合林区交通网络自身的特点,引入道路宽度、最大限速、必经地和忽略地等森林防火路径分析约束因子,并以此作为道路权值确定的依据,提出了带约束条件的森林防火最优路径算法,并给出详细的算法设计与实现。该算法符合森林防火的实际情况,能够在森林防火应急指挥与决策中发挥作用。
With path analysis algorithm in forest fire prevention as its research object and on the basis of the Dijkstra shortest path algorithm, this research improved and optimized the path analysis algorithm according to the special requirements of path analysis algorithm in forest fire prevention. Combining the characteristics of the traffic network in forest area, introducing constraint factors of forest fire path analysis such as road width, maximum speed limit, inevitable and ignored roads, and making the constraint factors as the foundation for road weight determination, the paper proposed the optimal path algorithm with constraints for forest fire pre- vention and released a detailed algorithm design and implementation. The algorithm fitted in the actual situa- tion of forest fire prevention and could play an important role in forest fire emergency-commanding and deci- sion-making. [Ch, 2 fig. 2 tab. 17 ref. ]
出处
《浙江农林大学学报》
CAS
CSCD
北大核心
2013年第1期76-82,共7页
Journal of Zhejiang A&F University
基金
浙江省自然科学基金资助项目(Y3100352)
浙江省重大科技专项(2011C12047)
浙江省教育厅资助项目(Y201018063)
浙江农林大学科研发展基金资助项目(2010FK015)
关键词
森林保护学
森林防火
路径分析
约束条件
约束因子
forest protection
forest fire prevention
path analysis
constraints
constraint factor
