Skip to Main content Skip to Navigation
Book sections

Tabu search heuristic for competitive base station location problem

Abstract : We consider the base stations location problem with sharing. New operator arrives the market and competes with an existing network of another operator. Latter one can share BS cites with new operator, receiving a rent payment from him. We propose new model of realistic clients behavior and formulate the problem as a nonlinear integer programming problem. We propose a fast tabu search heuristic for this problem and provide some computational results.
Document type :
Book sections
Complete list of metadata
Contributor : TelecomParis HAL Connect in order to contact the contributor
Submitted on : Friday, September 13, 2019 - 4:51:26 PM
Last modification on : Wednesday, November 3, 2021 - 6:18:15 AM


  • HAL Id : hal-02287318, version 1


Marceau Coupechoux, Ivan Davydov, Stefano Iellamo. Tabu search heuristic for competitive base station location problem. Operations Research Proceedings 2015, Springer, pp.325-330, 2017. ⟨hal-02287318⟩



Record views