@inproceedings{1f828026ea1b458fa99d409bea10feb1,
title = "Multi-start local search procedure for the maximum fire risk insured capital problem",
abstract = "A recently European Commission regulation requires insurance companies to determine the maximum value of insured fire risk policies of all buildings that are partly or fully located within circle of a radius of 200{\^A} m. In this work, we present the multi-start local search meta-heuristics that has been developed to solve the real case of an insurance company having more than 400 thousand insured buildings in mainland Portugal. A random sample of the data set was used and the solutions of the meta-heuristic were compared with the optimal solution of a MILP model based on the Maximal Covering Location Problem. The results show the proposed approach to be very efficient and effective in solving the problem.",
keywords = "Continuous location problem, Local search, Meta-heuristics, Solvency II",
author = "Gomes, {Maria Isabel} and Afonso, {Lourdes B.} and Nelson Chibeles-Martins and Fradinho, {Joana M.}",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-3-319-96151-4_19",
language = "English",
isbn = "9783319961507",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "219--227",
booktitle = "Combinatorial Optimization - 5th International Symposium, ISCO 2018, Revised Selected Papers",
note = "5th International Symposium on Combinatorial Optimization, ISCO 2018 ; Conference date: 11-04-2018 Through 13-04-2018",
}