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.
This is a preview of subscription content, log in via an institution to check access.
References
Iellamo, S., Alekseeva, E., Chen, L., Coupechoux, M., Kochetov, Y.: Competitive location in cognitive radio networks. 4OR 13(1), 81–110 (2015)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)
Acknowledgements
The second author’s work is supported by Russian Foundation for Basic Research (grant 15-07-01141 A).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this paper
Cite this paper
Coupechoux, M., Davydov, I., Iellamo, S. (2017). Tabu Search Heuristic for Competitive Base Station Location Problem. In: Dörner, K., Ljubic, I., Pflug, G., Tragler, G. (eds) Operations Research Proceedings 2015. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-42902-1_44
Download citation
DOI: https://doi.org/10.1007/978-3-319-42902-1_44
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42901-4
Online ISBN: 978-3-319-42902-1
eBook Packages: Business and ManagementBusiness and Management (R0)