Multi-start local search procedure for the maximum fire risk insured capital problem

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Downloads (Pure)

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 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.

Original languageEnglish
Title of host publicationCombinatorial Optimization - 5th International Symposium, ISCO 2018, Revised Selected Papers
PublisherSpringer Verlag
Pages219-227
Number of pages9
ISBN (Print)9783319961507
DOIs
Publication statusPublished - 1 Jan 2018
Event5th International Symposium on Combinatorial Optimization, ISCO 2018 - Marrakesh, Morocco
Duration: 11 Apr 201813 Apr 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher Springer Verlag
Volume10856 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Symposium on Combinatorial Optimization, ISCO 2018
CountryMorocco
CityMarrakesh
Period11/04/1813/04/18

Fingerprint

Multistart
Insurance
Metaheuristics
Local Search
Fires
Covering Problem
Mixed Integer Linear Programming
Location Problem
Industry
Circle
Optimal Solution
Radius
Model-based
Buildings
Policy

Keywords

  • Continuous location problem
  • Local search
  • Meta-heuristics
  • Solvency II

Cite this

Gomes, M. I., Afonso, L. B., Chibeles-Martins, N., & Fradinho, J. M. (2018). Multi-start local search procedure for the maximum fire risk insured capital problem. In Combinatorial Optimization - 5th International Symposium, ISCO 2018, Revised Selected Papers (pp. 219-227). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10856 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-96151-4_19
Gomes, Maria Isabel ; Afonso, Lourdes B. ; Chibeles-Martins, Nelson ; Fradinho, Joana M. / Multi-start local search procedure for the maximum fire risk insured capital problem. Combinatorial Optimization - 5th International Symposium, ISCO 2018, Revised Selected Papers. Springer Verlag, 2018. pp. 219-227 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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 = "1",
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",

}

Gomes, MI, Afonso, LB, Chibeles-Martins, N & Fradinho, JM 2018, Multi-start local search procedure for the maximum fire risk insured capital problem. in Combinatorial Optimization - 5th International Symposium, ISCO 2018, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10856 LNCS, Springer Verlag, pp. 219-227, 5th International Symposium on Combinatorial Optimization, ISCO 2018, Marrakesh, Morocco, 11/04/18. https://doi.org/10.1007/978-3-319-96151-4_19

Multi-start local search procedure for the maximum fire risk insured capital problem. / Gomes, Maria Isabel; Afonso, Lourdes B.; Chibeles-Martins, Nelson; Fradinho, Joana M.

Combinatorial Optimization - 5th International Symposium, ISCO 2018, Revised Selected Papers. Springer Verlag, 2018. p. 219-227 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10856 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Multi-start local search procedure for the maximum fire risk insured capital problem

AU - Gomes, Maria Isabel

AU - Afonso, Lourdes B.

AU - Chibeles-Martins, Nelson

AU - Fradinho, Joana M.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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 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.

AB - 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 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.

KW - Continuous location problem

KW - Local search

KW - Meta-heuristics

KW - Solvency II

UR - http://www.scopus.com/inward/record.url?scp=85050611271&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-96151-4_19

DO - 10.1007/978-3-319-96151-4_19

M3 - Conference contribution

SN - 9783319961507

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 219

EP - 227

BT - Combinatorial Optimization - 5th International Symposium, ISCO 2018, Revised Selected Papers

PB - Springer Verlag

ER -

Gomes MI, Afonso LB, Chibeles-Martins N, Fradinho JM. Multi-start local search procedure for the maximum fire risk insured capital problem. In Combinatorial Optimization - 5th International Symposium, ISCO 2018, Revised Selected Papers. Springer Verlag. 2018. p. 219-227. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-96151-4_19