.png){kind=icon}
.png){kind=icon}
Return
Solving the geometric firefighter routing problem via integer programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2018.10.037.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we introduce the Geometric Firefighter Routing Problem (GFRP) as a variant of the Geometric Firefighter Problem aiming to better model more realistic situations. We design an exact algorithm based on a core Linear Integer Programming formulation and propose additional sets of valid constraints to strengthen it. The algorithm also includes primal heuristics, and preprocessing procedures to reduce the model size. Besides, we generate two large sets of instances, tailored to the GFRP, and report on comprehensive experimental results for them. Thorough analysis validate the effectiveness of each major step of the algorithm and the overall performance of our approach. (C) 2018 Elsevier B.V. All rights reserved.
Keywords:
Combinatorial optimization
Integer programming
Computational geometry
Geometric firefighter routing problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W