New models for the location of controversial facilities: A bilevel programming approach

Motivated by recent real-life applications in Location Theory in which the location decisions generate controversy, we propose a novel bilevel location model in which, on the one hand, there is a leader that chooses among a number of fixed potential locations which ones to establish. Next, on the se...

Descripción completa

Detalles Bibliográficos
Autores: Labbé, Martine, Leal Palazón, Marina, Puerto Albandoz, Justo
Tipo de recurso: artículo
Estado:Versión enviada para evaluación y publicación
Fecha de publicación:2019
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/84653
Acceso en línea:https://hdl.handle.net/11441/84653
https://doi.org/10.1016/j.cor.2019.03.003
Access Level:acceso abierto
Palabra clave:Bilevel optimization
Locational analysis
Combinatorial optimization
id ES_7f85bb2009cd1b0819fe89909c077d4d
oai_identifier_str oai:idus.us.es:11441/84653
network_acronym_str ES
network_name_str España
repository_id_str
spelling New models for the location of controversial facilities: A bilevel programming approachLabbé, MartineLeal Palazón, MarinaPuerto Albandoz, JustoBilevel optimizationLocational analysisCombinatorial optimizationMotivated by recent real-life applications in Location Theory in which the location decisions generate controversy, we propose a novel bilevel location model in which, on the one hand, there is a leader that chooses among a number of fixed potential locations which ones to establish. Next, on the second hand, there is one or several followers that, once the leader location facilities have been set, chooses his location points in a continuous framework. The leader’s goal is to maximize some proxy to the weighted distance to the follower’s location points, while the follower(s) aim is to locate his location points as close as possible to the leader ones. We develop the bilevel location model for one follower and for any polyhedral distance, and we extend it for several followers and any ℓp-norm, p ∈ Q, p ≥ 1. We prove the NP-hardness of the problem and propose different mixed integer linear programming formulations. Moreover, we develop alternative Benders decomposition algorithms for the problem. Finally, we report some computational results comparing the formulations and the Benders decompositions on a set of instances.Fonds de la Recherche Scientique - FNRSMinisterio de Economía y CompetitividadFondo Europeo de Desarrollo RegionalElsevierEstadística e Investigación OperativaFQM331: Métodos y Modelos de la Estadística y la Investigación Operativa2019info:eu-repo/semantics/articleinfo:eu-repo/semantics/submittedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/84653https://doi.org/10.1016/j.cor.2019.03.003reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésComputers and Operations Research, 107, 95-106.PDR T0098.18MTM2016-74983-C02-01https://reader.elsevier.com/reader/sd/pii/S0305054819300577?token=8B66E948782A1925EFF27AA635D99CA67AD510E3FE1CC9868E963BB1F932FEC2C5FF49B01CC35B41106B024FC408E117info:eu-repo/semantics/openAccessoai:idus.us.es:11441/846532026-06-17T12:51:07Z
dc.title.none.fl_str_mv New models for the location of controversial facilities: A bilevel programming approach
title New models for the location of controversial facilities: A bilevel programming approach
spellingShingle New models for the location of controversial facilities: A bilevel programming approach
Labbé, Martine
Bilevel optimization
Locational analysis
Combinatorial optimization
title_short New models for the location of controversial facilities: A bilevel programming approach
title_full New models for the location of controversial facilities: A bilevel programming approach
title_fullStr New models for the location of controversial facilities: A bilevel programming approach
title_full_unstemmed New models for the location of controversial facilities: A bilevel programming approach
title_sort New models for the location of controversial facilities: A bilevel programming approach
dc.creator.none.fl_str_mv Labbé, Martine
Leal Palazón, Marina
Puerto Albandoz, Justo
author Labbé, Martine
author_facet Labbé, Martine
Leal Palazón, Marina
Puerto Albandoz, Justo
author_role author
author2 Leal Palazón, Marina
Puerto Albandoz, Justo
author2_role author
author
dc.contributor.none.fl_str_mv Estadística e Investigación Operativa
FQM331: Métodos y Modelos de la Estadística y la Investigación Operativa
dc.subject.none.fl_str_mv Bilevel optimization
Locational analysis
Combinatorial optimization
topic Bilevel optimization
Locational analysis
Combinatorial optimization
description Motivated by recent real-life applications in Location Theory in which the location decisions generate controversy, we propose a novel bilevel location model in which, on the one hand, there is a leader that chooses among a number of fixed potential locations which ones to establish. Next, on the second hand, there is one or several followers that, once the leader location facilities have been set, chooses his location points in a continuous framework. The leader’s goal is to maximize some proxy to the weighted distance to the follower’s location points, while the follower(s) aim is to locate his location points as close as possible to the leader ones. We develop the bilevel location model for one follower and for any polyhedral distance, and we extend it for several followers and any ℓp-norm, p ∈ Q, p ≥ 1. We prove the NP-hardness of the problem and propose different mixed integer linear programming formulations. Moreover, we develop alternative Benders decomposition algorithms for the problem. Finally, we report some computational results comparing the formulations and the Benders decompositions on a set of instances.
publishDate 2019
dc.date.none.fl_str_mv 2019
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/submittedVersion
format article
status_str submittedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/84653
https://doi.org/10.1016/j.cor.2019.03.003
url https://hdl.handle.net/11441/84653
https://doi.org/10.1016/j.cor.2019.03.003
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Computers and Operations Research, 107, 95-106.
PDR T0098.18
MTM2016-74983-C02-01
https://reader.elsevier.com/reader/sd/pii/S0305054819300577?token=8B66E948782A1925EFF27AA635D99CA67AD510E3FE1CC9868E963BB1F932FEC2C5FF49B01CC35B41106B024FC408E117
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869411830794813440
score 15.300724

Similares en LA Referencia