IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-42902-1_44.html
   My bibliography  Save this book chapter

Tabu Search Heuristic for Competitive Base Station Location Problem

In: Operations Research Proceedings 2015

Author

Listed:
  • Marceau Coupechoux

    (Télécom ParisTech and CNRS LTCI)

  • Ivan Davydov

    (Sobolev Institute of Mathematics)

  • Stefano Iellamo

    (Télécom ParisTech and CNRS LTCI)

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.

Suggested Citation

  • Marceau Coupechoux & Ivan Davydov & Stefano Iellamo, 2017. "Tabu Search Heuristic for Competitive Base Station Location Problem," Operations Research Proceedings, in: Karl Franz Dörner & Ivana Ljubic & Georg Pflug & Gernot Tragler (ed.), Operations Research Proceedings 2015, pages 325-330, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-42902-1_44
    DOI: 10.1007/978-3-319-42902-1_44
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-319-42902-1_44. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.