New models for the location of controversial ...
Type de document :
Compte-rendu et recension critique d'ouvrage
Titre :
New models for the location of controversial facilities: A bilevel programming approach
Auteur(s) :
Labbé, Martine [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Leal, Marina [Auteur]
Departamento de Matemática Aplicada I [IMUS]
Puerto, Justo [Auteur]
Departamento de Matemática Aplicada I [IMUS]
Integrated Optimization with Complex Structure [INOCS]
Leal, Marina [Auteur]
Departamento de Matemática Aplicada I [IMUS]
Puerto, Justo [Auteur]
Departamento de Matemática Aplicada I [IMUS]
Titre de la revue :
Computers and Operations Research
Pagination :
95 -106
Éditeur :
Elsevier
Date de publication :
2019
ISSN :
0305-0548
Mot(s)-clé(s) en anglais :
Bilevel optimization
locational analysis
combinatorial optimiza-tion
locational analysis
combinatorial optimiza-tion
Discipline(s) HAL :
Informatique [cs]/Recherche opérationnelle [cs.RO]
Résumé en anglais : [en]
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 ...
Lire la suite >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.Lire moins >
Lire la suite >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.Lire moins >
Langue :
Anglais
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.inria.fr/hal-01933601/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01933601/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01933601/file/BilevelLocation.pdf
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01933601/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- BilevelLocation.pdf
- Accès libre
- Accéder au document