2399. Solving the Team Orienteering Problem with Variable Time Windows applied to Wildfire suppression
Invited abstract in session TB-20: Applications of combinatorial optimisation in industry and services 2, stream Combinatorial Optimization.
Tuesday, 10:30-12:00Room: Esther Simpson 2.11
Authors (first author is the speaker)
| 1. | Begoña Vitoriano
|
| Dept. of Statistics and Operational Research, Interdisciplinary Mathematics Institute, Universidad Complutense de Madrid | |
| 2. | Bibiana Granda
|
| Department of Statistics and Operational Research, Interdisciplinary Mathematics Institute, Universidad Complutense de Madrid |
Abstract
The Orienteering Problem (OP) is a well-known routing problem within Operational Research, from which various variants have emerged over time. The Team Orienteering Problem with Variable Time Windows (TOPVTW) is a new variant based on the Team Orienteering Problem with Time Windows, with time windows evolving dynamically according to the solution and a diffusion process. An application to wildfire suppression will be presented, where the fire spread determines the time windows for brigades to work in a parcel of the landscape or cross through it. Simultaneously, the brigades' work controlling parcels modifies the spread of fire, preventing it from spreading through the controlled area. The aim is to determine the places to be controlled and the brigades’ routes through the landscape to minimize the value of the burned area while maintaining safety measures for the teams. This problem must be solved very quickly to be useful. Several methods are explored, and the results will be implemented in a tool for practitioners in the context of the HORIZON Europe project HURRICANE.
Keywords
- Vehicle Routing
- Disaster and Crisis Management
- Forestry Management
Status: accepted
Back to the list of papers