Abstract

The frequency and impact of wildfires have considerably increased in the past decade, due to the extreme weather conditions as well as the increased population density. The aim of this study is to introduce, model, and solve a wildfire suppression problem that involves multiple types of fire suppression resources and their operational characteristics. Two integer programming (IP) formulations, a basic IP and its reformulation with combinatorial Benders’ cuts, are presented. The performances of the proposed formulations are evaluated on a set of randomly generated instances. The results indicate that the proposed formulations are able to obtain high quality upper and lower bounds. Extensive numerical experiments are performed to analyse the effects of several operational constraints on the computational performance of the models. A case study arising in Yatağan district of Muğla province of Türkiye is presented.
Original languageEnglish
Pages (from-to)488-502
Number of pages15
JournalEuropean Journal of Operational Research
Volume316
Issue number2
Early online date4 Mar 2024
DOIs
Publication statusE-pub ahead of print - 4 Mar 2024

Keywords

  • Combinatorial Benders’ cuts
  • Mathematical modelling
  • OR in disaster relief
  • Wildfire suppression

ASJC Scopus subject areas

  • Information Systems and Management
  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research

Fingerprint

Dive into the research topics of 'The Wildfire Suppression Problem with multiple types of resources'. Together they form a unique fingerprint.

Cite this