We study the problem of locating fire suppression resources in a burning landscape in order to minimise the total area burned. The landscape is modelled as a directed graph, with nodes representing regions of the landscape, and arcs representing adjacency relationships. The fire spread is modelled using the minimum travel time principle. We propose a non-linear integer programming formulation and an exact solution approach utilising logic-based Benders decomposition. We benchmark the approach against a mixed integer program and an iterated local search metaheuristic from the literature. We are able to solve challenging instances to proven optimality in a reasonable amount of time.
Cite
@article{arxiv.2209.01371,
title = {Logic-Based benders Decomposition for Wildfire Suppression},
author = {Mitchell G Harris and Michael A Forbes and Thomas Taimre},
journal= {arXiv preprint arXiv:2209.01371},
year = {2022}
}