Tabu search heuristic for competitive base station location problem - Télécom Paris Access content directly
Book Sections Year : 2017

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

Dates and versions

hal-02287318 , version 1 (13-09-2019)

Identifiers

  • HAL Id : hal-02287318 , version 1

Cite

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⟩
28 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More