Toward efficient management of large fires: A mixed integer programming model and two iterative approaches

28Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

Abstract

In this study, we developed an optimization model and two iterative approaches to improve the efficiency of large fire management. This model allocates suppression effort across time and space to minimize fire loss within a defined duration. It departs from previous research by replacing simplified fire containment rules with progressbased fire loss control. This is accomplished by extending the minimum travel time algorithm to build a large fire suppression model. Mixed integer programming is used to integrate spatial information such as fire behavior, firefighter safety, and values at risk to guide large fire suppression. The concern of time-specific suppression allocation is modeled through two iterative approaches using different logical procedures. Test cases demonstrate how this model assembles spatial data to support suppression decisions for one fire or multiple simultaneous fires. Suppression is also scheduled across 30 randomly simulated fires in Sequoia and Kings Canyon National Parks. Results demonstrate that suppression delay can significantly increase fire loss. Simulation results show that iterative approach A is more efficient in distributing suppression effort into short time periods. © 2011 by the Society of American Foresters.

Cite

CITATION STYLE

APA

Wei, Y., Rideout, D. B., & Hall, T. B. (2011). Toward efficient management of large fires: A mixed integer programming model and two iterative approaches. Forest Science, 57(5), 435–447. https://doi.org/10.1093/forestscience/57.5.435

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free