Please use this identifier to cite or link to this item:
|Title:||Solving the geometric firefighter routing problem via integer programming|
|Author:||Zambon, Mauricio J. O.|
de Rezende, Pedro J.
de Souza, Cid C.
|Abstract:||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|
|Appears in Collections:||IC - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.