工业工程 ›› 2024, Vol. 27 ›› Issue (4): 121-131.doi: 10.3969/j.issn.1007-7375.230136

• 系统建模与优化 • 上一篇    

考虑道路受阻的森林火灾应急资源联合调度优化研究

吴鹏, 王路兵, 储诚斌   

  1. 福州大学 经济与管理学院,福建 福州 350108
  • 收稿日期:2023-07-10 发布日期:2024-09-07
  • 通讯作者: 王路兵 (1996—),男,江西省人,硕士研究生,主要研究方向为应急管理研究。Email:wanglubing1014@163.com E-mail:wanglubing1014@163.com
  • 作者简介:吴鹏 (1987—),男,江西省人,教授,博士,主要研究方向为运筹与优化等。Email:wupeng88857@126.com
  • 基金资助:
    教育部人文社科规划基金资助项目 (21YJA630096);福建省自然科学基金资助项目 (2022J01075);福建省雏鹰计划青年拔尖人才计划项目 (0470-00472214);中国工程院院地合作项目 (2022-FJ-ZD-1)

Joint Optimization of Emergency Resource Scheduling for Forest Fires Considering Road Obstruction

WU Peng, WANG Lubing, CHU Chengbin   

  1. School of Economics and Management, Fuzhou University, Fuzhou 350108, China
  • Received:2023-07-10 Published:2024-09-07

摘要: 针对森林火灾发生后可能存在的交通路网受阻情况,探讨一类新的森林火灾应急资源联合调度优化策略,构建了兼顾资源受限和道路受阻的森林火灾应急资源联合调度的混合整数线性规划模型。为减少森林火灾造成的资源损失,优化目标设定为最小化消防救援时间,并且根据问题特性设计两种编码方式的改进人工蜂群算法。最后,通过典型实例和随机仿真算例进行实验验证。实验结果表明:1) 对于实际案例和中小规模仿真案例,采用商业求解器CPLEX求解模型,能够在5 min内获得最优的消防救援方案;2) 对于大规模森林火灾,提出的改进人工蜂群算法求解性能优于商业求解器CPLEX,只需10 s就能够获得更高质量的消防救援方案,可为道路受阻下的森林火灾应急救援团队提供有效的消防救援方案。

关键词: 森林火灾, 道路受阻, 联合调度, 线性规划, 人工蜂群算法

Abstract: A new joint optimization problem for emergency resource scheduling is studied to address the possible obstruction issue of transportation roads after forest fires. A mixed-integer linear programming model for joint scheduling of emergency resources for forest fires is established considering both resource constraints and road obstruction. The optimization objective is to minimize the fire rescue time to reduce the resource loss caused by forest fires. To quickly and efficiently solve the problem, an improved artificial bee colony algorithm with two encoding methods is designed according to the problem characteristics. Finally, experimental results from typical instances and stochastic simulation instances show that i) for real-life instances and small- to medium-scale simulation instances, the optimal fire rescue plan can be obtained within 5 minutes by using the commercial solver CPLEX; and ii) for large-scale forest fires, the proposed improved artificial bee colony algorithm outperforms the commercial solver CPLEX, achieving a higher-quality fire rescue plan in just 10 seconds. It can provide an effective fire rescue plan for emergency teams with road obstruction.

Key words: forest fires, road obstruction, joint scheduling, linear programming, artificial bee colony algorithm

中图分类号: