F. Alvelos, I. Martins

We integrate suppression planning into a simulation-based optimization framework for forest management. Forest management is iteratively guided by feedback from fire spread simulations and the optimization of firefighting resource base locations.
The approach employs mixed integer programming to solve the forest management problem and optimize the distribution of firefighting bases. It uses shortest path algorithms to assess fire potential by identifying high-risk paths that could lead to unacceptable fire spread. If such paths are detected, the algorithm adjusts the constraints of the forestry model and re-optimizes both forest management and firefighting base placement. This iterative process continues until no unacceptable fire paths are found. Fire paths are obtained by representing the forest as a network. To model potential base locations, a resource network is also defined. We present computational experiments conducted in a Portuguese forest to test this approach.

Keywords: forestry, wildfire, mixed integer programming

Scheduled

APDIO-SEIO
June 11, 2025  10:30 AM
Sala VIP Jaume Morera i Galícia


Other papers in the same session


Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.