Skip to main content
SpringerLink
Log in
Book cover

International Conference on Discrete Optimization and Operations Research

DOOR 2016: Discrete Optimization and Operations Research pp 364–372Cite as

Tabu Search Approach for the Bi-Level Competitive Base Station Location Problem

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9869))

Abstract

This paper addresses the competitive base stations location problem with sharing. Two mobile operators, the leader and the follower, compete to attract customers from a given market of high-speed internet connection. The leader acts first by placing a number of base stations, anticipating that the follower will react to the decision by creating his own network. The Leader can share BS cites with the follower operator, receiving a rent payment from him. We propose new model of realistic clients behavior, when the choice of the operator is made upon the average quality of service. We provide a formulation of this 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.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Beresnev, V.L., Mel’nikov, A.A.: Approximate algorithms for the competitive facility location problem. Autom. Remote Control 5(2), 180–190 (2011)

    MathSciNet  MATH  Google Scholar 

  2. Davydov, I.A., Kochetov, Y., Mladenovic, N., Urosevic, D.: Fast metaheuristics for the discrete \((r|p)\)-centroid problem. Autom. Remote Control 75(4), 677–687 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  3. Davydov, I., Coupechoux, M., Iellamo, S.: Tabu search heuristic for competitive base station location problem. In: OR2015 Proceedings. (accepted, in press) (2016)

    Google Scholar 

  4. Diakova, Z., Kochetov, Y.: A double VNS heuristic for the facility location and pricing problem. Electron. Notes Discrete Math. 39, 29–34 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  5. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)

    Book  MATH  Google Scholar 

  6. Lellamo, S., Alekseeva, E., Chen, L., Coupechoux, M., Kochetov, Y.: Competitive location in cognitive radio networks. 4OR 13, 81–110 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  7. ANFR Cartoradio. http://www.cartoradio.fr/cartoradio/web/

  8. Mel’nikov, A.A.: Randomized local search for the discrete competitive facility location problem. Autom. Remote Control 75(4), 700–714 (2014)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The first author work was supported by Russian Science Foundation (project 15-11-10009).

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Av. Koptyuga 4, Novosibirsk, Russia

    Ivan Davydov

  2. Novosibirsk State University, ul. Pirogova 2, Novosibirsk, Russia

    Ivan Davydov

  3. Télécom ParisTech and CNRS LTCI, 6, Rue Barrault, Paris, France

    Marceau Coupechoux

  4. Foundation for Research and Technology Hellas (FORTH), Leof. Plastira 100, Iraklio, Greece

    Stefano Iellamo

Authors
  1. Ivan Davydov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marceau Coupechoux
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stefano Iellamo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ivan Davydov .

Editor information

Editors and Affiliations

  1. Sobolev Institute of Mathematics , Novosibirsk, Russia

    Yury Kochetov

  2. Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia

    Michael Khachay

  3. Sobolev Institute of Mathematics , Novosibirsk, Russia

    Vladimir Beresnev

  4. Far Eastern Federal University , Vladivostik, Russia

    Evgeni Nurminski

  5. University of Florida , Gainesville, Florida, USA

    Panos Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Davydov, I., Coupechoux, M., Iellamo, S. (2016). Tabu Search Approach for the Bi-Level Competitive Base Station Location Problem. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds) Discrete Optimization and Operations Research. DOOR 2016. Lecture Notes in Computer Science(), vol 9869. Springer, Cham. https://doi.org/10.1007/978-3-319-44914-2_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44914-2_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44913-5

  • Online ISBN: 978-3-319-44914-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation