Logic-based Benders decomposition for wildfire suppression
From MaRDI portal
Publication:6068720
DOI10.1016/J.COR.2023.106392arXiv2209.01371OpenAlexW4385987974MaRDI QIDQ6068720FDOQ6068720
Authors: M. G. Harris, Michael A. Forbes, Thomas Taimre 
Publication date: 13 November 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/2209.01371
Cites Work
- A note on two problems in connexion with graphs
- Partitioning procedures for solving mixed-variables programming problems
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Logic-based Benders decomposition
- Generalized Benders decomposition
- Canonical Cuts on the Unit Hypercube
- Removing Arcs from a Network
- Methods for removing links in a network to minimize the spread of infections
- Title not available (Why is that?)
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Minimum vertex blocker clique problem
- Shortest-path network interdiction
- Matching interdiction
- Maximizing the minimum source-sink path subject to a budget constraint
- Title not available (Why is that?)
- Fire containment in grids of dimension three and higher
- Title not available (Why is that?)
- The capacitated standard response fire protection siting problem: Deterministic and probabilistic models
- The Benders decomposition algorithm: a literature review
- LP formulations of the shortest path tree problem
- Bilevel Knapsack with Interdiction Constraints
- An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression
- A survey of network interdiction models and algorithms
- Logic-Based Benders Decomposition for Large-Scale Optimization
- A matheuristic for the firefighter problem on graphs
- Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks
This page was built for publication: Logic-based Benders decomposition for wildfire suppression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6068720)
