An Integer Linear Programming Model to Select and Temporally Allocate Resources for Fighting Forest Fires
| العنوان: | An Integer Linear Programming Model to Select and Temporally Allocate Resources for Fighting Forest Fires |
|---|---|
| المؤلفون: | Balbina Casas-Méndez, Jorge Rodríguez-Veiga, María José Ginzo-Villamayor |
| المساهمون: | Universidade de Santiago de Compostela. Departamento de Estatística, Análise Matemática e Optimización |
| المصدر: | Forests, Vol 9, Iss 10, p 583 (2018) Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela instname Forests Volume 9 Issue 10 |
| بيانات النشر: | MDPI AG, 2018. |
| سنة النشر: | 2018 |
| مصطلحات موضوعية: | Simulation study, Operations research, Linear programming, Computer science, Interface (Java), Heuristic (computer science), Time allocation, 0211 other engineering and technologies, 02 engineering and technology, wildfire suppression, Task (project management), Integer linear programming model, 040101 forestry, Wildfire suppression, 021103 operations research, Computer program, Resource planning, time allocation, Forestry, lcsh:QK900-989, 04 agricultural and veterinary sciences, Interface, Resolution (logic), simulation study, lcsh:Plant ecology, resource planning, interface, 0401 agriculture, forestry, and fisheries, integer linear programming model |
| الوصف: | Optimal planning of the amount and type of resources needed for extinguishing a forest fire is a task that has been addressed in the literature, using models obtained from operational research. In this study, a general integer linear programming model is proposed, which addresses the allocation of resources in different time periods during the planning period for extinguishing a fire, and with the goal of meeting Spanish regulations for the non-negligence of fronts and periods of rest for pilots and brigades. A computer program and interface were developed using the R language. By means of an example using historical data, we illustrate the model at work and its exact resolution. Then, we carry out a simulation study to analyze the obtained objective functions and resolution times. Our simulation study shows that an exact solution can be obtained very quickly without requiring heuristic algorithms, provided that the planning period does not exceed five hours This research received financial support from Ministerio de Economía y Competitividad of Spain through grants MTM2014-53395-C3-2-P, MTM2016-76969-P and MTM2017-87197-C3-3-P, and from ITMATI, Technological Institute of Industrial Mathematics, Santiago de Compostela, Spain, through the Enjambre project. Both are gratefully acknowledged SI |
| وصف الملف: | application/pdf |
| تدمد: | 1999-4907 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b67333fb059ce18677011720fd161828 https://doi.org/10.3390/f9100583 |
| حقوق: | OPEN |
| رقم الأكسشن: | edsair.doi.dedup.....b67333fb059ce18677011720fd161828 |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 19994907 |
|---|