资源受限下考虑救援优先级的森林火灾应急资源调度

Forest Fires Emergency Resource Scheduling Considering Rescue Priority Under Resource Constraints

在资源受限情况下,最大限度地减少森林火灾造成的资源损失,实施快速高效的森林消防应急救援成为亟待解决的现实问题.针对森林火灾救援问题的特点,根据不同火灾点的严重程度和火势蔓延速度对火灾救援优先级进行划分;在此基础上,以消防车辆救援时间最小化作为优化目标,建立消防救援车辆路径优化的混合整数线性规划模型.为解决资源受限下森林火灾应急资源调度问题,提出一种基于实数编码的改进人工蜂群算法.具体包括根据问题特点设计基于启发式思想的种群初始化,提出一种均匀策略提升解码质量,并设计高效的交叉算子提升雇佣蜂和跟随蜂的寻优搜索能力,避免算法陷入局部最优.最后,基准算例和大量随机生成算例对比测试结果验证了算法的有效性.

Implementing fast and efficient forest firefighting and rescue has become a hot issue.This paper studies how to minimize the loss of resources caused by forest fires under resource constraints.According to the characteristics of forest firefighting,this paper divides the firefighting sequence by the severity of different fire spots and the spreading speed.On this basis,a mixed integer linear programming model for routing optimization of firefighting and rescue vehicles is established with the objective of minimizing the total firefighting time.To solve the scheduling problem of forest firefighting and rescue under resource constraints,an improved artificial bee colony algorithm based on real number encoding is proposed.Specifically,we design a heuristic method for population initialization,propose a uniform decoding method to improve the decoding quality,and design an efficient crossover operator to improve the optimization search ability of the employer bee and the follower bee,so as to avoid the algorithm falling into local optimum.Finally,the algorithm is tested on a benchmark instance and a large number of randomly generated instance to demonstrate its effectiveness and efficiency.