森林防火多出救点应急调度算法

A multi-depot emergency scheduling algorithm for forest fire prevention

在森林重大火灾应急调度时,要保证在灭火时间最短的前提下使出救点个数尽可能少。当前火灾应急调度模型均是基于目标变量(即需求的灭火资源总量)确定的前提下提出的,但灭火资源所需数量是随时间、气候、地形地貌等变化而变化的,需要结合林火蔓延模型来求解目标变量,进而结合"灭火时间最短"和"出救点个数最少"2个约束条件,得出一次性消耗的应急多出救点资源调度的计算方法。以王正非等的林火蔓延模型为基础,在考虑火速、风力、坡度等因素下,得出不同着火时间下灭火资源动态需求量,结合模糊规划方法求解救火时间最短以及出救点个数最少的森林资源火灾应急调度优化出救方案,并给出了仿真案例,旨在为森林扑火行动提供一定的理论和实践指导。

During current forest conflagration emergency scheduling,fire emergency dispatch models are mainly based on determinate target variables that employ the total demand for fire-fighting resources,but do not consider changes in time,climate,topography,or other factors.In this research,a forest fire spread model was used to obtain target variables;these variables were then combined with constraints of ＂shortest fire-fighting time＂ and ＂least number of the rescue points＂ so as to obtain an emergency scheduling algorithm based on one-time consumption and multiple depots.This research utilized Wang Zhengfei’s forest fire spread model to consider the rate of forest fire spread,wind level and slope to calculate the dynamic need for firefighting resources at different fire-times.Then the fuzzy programming method for conditions of ＂shortest fire-fighting time＂ and ＂least number of the rescue points＂ was used to optimize a fire emergency rescue plan which was tested with a simulation case.Results showed that this model could provide a theoretical and practical guide for forest fire-fighting operations.