Author
Listed:
- Bruno R. Gutiérrez-De-La-Paz
(Centro de Investigación en Computación del Instituto Politécnico Nacional, Mexico City 07738, Mexico
These authors contributed equally to this work.)
- Jesús García-Díaz
(Consejo Nacional de Ciencia y Tecnología, Mexico City 03940, Mexico
Instituto Nacional de Astrofísica, Óptica y Electrónica, Coordinación de Ciencias Computacionales, Puebla 72840, Mexico
These authors contributed equally to this work.)
- Rolando Menchaca-Méndez
(Centro de Investigación en Computación del Instituto Politécnico Nacional, Mexico City 07738, Mexico
These authors contributed equally to this work.)
- Mauro A. Montenegro-Meza
(Centro de Investigación en Computación del Instituto Politécnico Nacional, Mexico City 07738, Mexico
These authors contributed equally to this work.)
- Ricardo Menchaca-Méndez
(Centro de Investigación en Computación del Instituto Politécnico Nacional, Mexico City 07738, Mexico
These authors contributed equally to this work.)
- Omar A. Gutiérrez-De-La-Paz
(Centro de Investigación en Computación del Instituto Politécnico Nacional, Mexico City 07738, Mexico
These authors contributed equally to this work.)
Abstract
The original formulation of the firefighter problem defines a discrete-time process where a fire starts at a designated subset of the vertices of a graph G . At each subsequent discrete time unit, the fire propagates from each burnt vertex to all of its neighbors unless they are defended by a firefighter that can move between any pair of vertices in a single time unit. Once a vertex is burnt or defended, it remains in that state, and the process terminates when the fire can no longer spread. In this work, we present the moving firefighter problem, which is a generalization of the firefighter problem where the time it takes a firefighter to move from a vertex u to defend vertex v is determined by a function τ . This new formulation models situations such as a wildfire or a flood, where firefighters have to physically move from their current position to the location of an entity they intend to defend. It also incorporates the notion that entities modeled by the vertices are not necessarily instantaneously defended upon the arrival of a firefighter. We present a mixed-integer quadratically constrained program (MIQCP) for the optimization version of the moving firefighter problem that minimizes the number of burnt vertices for the case of general finite graphs, an arbitrary set F ⊂ V of vertices where the fire breaks out, a single firefighter, and metric time functions τ .
Suggested Citation
Bruno R. Gutiérrez-De-La-Paz & Jesús García-Díaz & Rolando Menchaca-Méndez & Mauro A. Montenegro-Meza & Ricardo Menchaca-Méndez & Omar A. Gutiérrez-De-La-Paz, 2022.
"The Moving Firefighter Problem,"
Mathematics, MDPI, vol. 11(1), pages 1-15, December.
Handle:
RePEc:gam:jmathe:v:11:y:2022:i:1:p:179-:d:1019106
Download full text from publisher
References listed on IDEAS
- O. Zambon, Mauricio J. & J. de Rezende, Pedro & C. de Souza, Cid, 2019.
"Solving the geometric firefighter routing problem via integer programming,"
European Journal of Operational Research, Elsevier, vol. 274(3), pages 1090-1101.
- Nima Khakzad, 2018.
"A Graph Theoretic Approach to Optimal Firefighting in Oil Terminals,"
Energies, MDPI, vol. 11(11), pages 1-14, November.
Full references (including those not matched with items on IDEAS)
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2022:i:1:p:179-:d:1019106. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.