摘要
为解决城市消防灭火救援系统中消防车出警不够迅捷的问题,本文提出了一种灭火救援最优路径算法。该算法在经典Dijkstra算法的基础上,提出了三点优化。通过搜索区域的限定可以解决大量无用结点参与计算带来的时间和空间的浪费问题,同时优化存储结构可节省大量的存储空间,最后,提出了双向查找规则,该规则减少了链接数量,有效地提高了寻找最优路径的效率。
In order to solve the question that the fire engine response is not fast enough in the urban fire fighting and rescue system,this paper proposes a optimal path algorithm for fire fighting and rescue work. The algorithm proposes three optimization on the basis of the classical Dijkstra algorithm.The wasting of time and space caused by calculating a large number of useless nodes can be solved through limiting the searching area.And the optimization of storage structure can save a lot of storage space.Finally,this paper puts forward the bidirectional search rules,the rules reduce the number of links, improve the efficiency of searching for the optimal path effectively .
出处
《电子测试》
2013年第10X期58-59,共2页
Electronic Test
关键词
最优路径
消防救援
双向查找规则
the optimal path
fire rescue
the bidirectional search rules.
