par Labbé, Martine ;Leal, Marina;Puerto, Justo
Référence Computers & operations research, 107, page (95-106)
Publication Publié, 2019-07-01
Article révisé par les pairs
Résumé : 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.