Tabu Search Heuristic for Competitive Base Station Location Problem

Marceau Coupechoux (), Ivan Davydov () and Stefano Iellamo ()
Additional contact information
Marceau Coupechoux: Télécom ParisTech and CNRS LTCI
Ivan Davydov: Sobolev Institute of Mathematics
Stefano Iellamo: Télécom ParisTech and CNRS LTCI

A chapter in Operations Research Proceedings 2015, 2017, pp 325-330 from Springer

Abstract: 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.

Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-42902-1_44

Ordering information: This item can be ordered from
http://www.springer.com/9783319429021

DOI: 10.1007/978-3-319-42902-1_44

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().