Resource‐Constrained Emergency Scheduling for Forest Fires with Priority Areas: An Efficient Integer‐Programming Approach

Abstract

This article deals with an emergency‐scheduling problem for forest fires with limited rescue team resources and priority disaster areas. It aims to determine optimal fire‐fighting routes of limited fire‐fighting teams for forest fires with multiple points subject to their priority levels so as to minimize the total travel distance of all rescue teams. For this problem, an integer linear‐programming (ILP) model is developed to generate its optimal schedule scheme, which is exactly solved by commercial software CPLEX. Moreover, the complexity of the problem is proved to be NP‐hard. Computational results show that benchmark and larger‐scale instances (with up to 100 fire points and 30 fire‐fighting teams) can be exactly solved within about 1 min and the proposed approach outperforms the state‐of‐the‐art one in terms of solution quality and computational time. The experimental results suggest that the proposed approach is potentially suitable for facilitating fast decision‐making when dealing with emergency scheduling for forest fires subject to limited rescue resources. Moreover, a new mixed‐integer program is developed to address the resource‐constrained emergency scheduling for forest fires with priority areas to minimize the total rescue time. © 2018 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

Supply energy management methods for a direct current microgrid: A comprehensive review

“…The impact of prediction error was reduced by using the receding horizon method. Wu et al 83 implemented an integer linear programming model to generate an optimal schedule scheme. The resource constrained emergency scheduling was addressed by developing a new mixed integer program.…”

Large-scale emergency medical services scheduling during the outbreak of epidemics

“…Currently, researchers have carried out a lot of research work in response to emergency events, mainly focusing on natural disasters, such as relief distribution (Yan et al, 2014 ; Ghasemi et al, 2019 ), emergency-response management (Wang et al, 2010 ; Caunhye et al, 2016 ), and logistics management (Ozdamar et al, 2004 ; Saber & Venayagamoorthy, 2011 ; Zhang et al, 2018 ; Feng et al, 2019 ). Meanwhile, many solution methods are proposed to solve these emergency management problems, e.g., integer programming (Sheu, 2007 ; Wu et al, 2019 ), goal programming (Vitoriano et al, 2011 ), dynamic programming (Yi & Ozdamar, 2007 ), fuzzy optimization (Zheng & Ling, 2013 ), and heuristic algorithms (Yi & Kumar, 2007 ; Ren & Tian, 2016 ; Liu et al, 2018 ). In emergency management, optimizing emergency rescue routes is an essential problem, which researchers have been widely concerned about (Zhang et al, 2018 ; Yuan & Wang, 2009 ; Zhang et al, 2013 ; Wilson et al, 2013 ; Chang et al, 2014 ; Wu et al, 2017 ).…”

A Genetic Algorithm for Forest Firefighting Optimization

“…Wu et al [29] developed an integer linear programming model to determine the optimal routes for forest firefighting. The problem was addressed as an emergency scheduling problem for fires with limited rescue team resources and priority disaster areas.…”