J. Rodríguez Veiga, M. J. Ginzo Villamayor, B. V. Casas Méndez
Determine optimal planning that includes the number and type of resources needed to extinguish a forest fire is a task that has been addressed in the literature using models taken from operational research. In this paper, a general integer programming model is proposed which also includes the allocation of resources to different periods of time in a day embedded in extinguishing a fire, with the goal of meeting the Spanish regulations regarding non-neglect of fronts and periods of rest of the pilots. We consider the exact solution to test the model and we also propose a single heuristic algorithm designed specifically for this problem which allows us to obtain a quality solution quickly when we are faced with a real problem. The computer programming and the design of the created interface has been realized with the language R.
Palabras clave / Keywords: wildfire suppression, aerial resources planning, time allocation, integer programming model, heuristic algorithm
Programado
Sesión GT10-3: Transportation / Transporte-3 (TRANSPORTE-3). Organizador: Julio González Díaz
29 de mayo de 2018 12:20
Sala 4
