Standard

Local search approach for the competitive facility location problem in mobile networks. / Davydov, Ivan; Kochetov, Yury; Dempe, Stephan.

In: International Journal of Artificial Intelligence, Vol. 16, No. 1, 01.03.2018, p. 130-143.

Research output: Contribution to journal › Article › peer-review

Harvard

Davydov, I, Kochetov, Y & Dempe, S 2018, 'Local search approach for the competitive facility location problem in mobile networks', International Journal of Artificial Intelligence, vol. 16, no. 1, pp. 130-143.

APA

Davydov, I., Kochetov, Y., & Dempe, S. (2018). Local search approach for the competitive facility location problem in mobile networks. International Journal of Artificial Intelligence, 16(1), 130-143.

Vancouver

Davydov I, Kochetov Y, Dempe S. Local search approach for the competitive facility location problem in mobile networks. International Journal of Artificial Intelligence. 2018 Mar 1;16(1):130-143.

Author

Davydov, Ivan ; Kochetov, Yury ; Dempe, Stephan. / Local search approach for the competitive facility location problem in mobile networks. In: International Journal of Artificial Intelligence. 2018 ; Vol. 16, No. 1. pp. 130-143.

BibTeX

@article{678ca367dc25425b913af702d392d667,
title = "Local search approach for the competitive facility location problem in mobile networks",
abstract = "We present a new leader-follower facility location game for 5G high-speed networks. Two mobile operators, the leader and the follower, compete to attract customers of high-speed internet connection. The leader acts first by opening some base stations, anticipating that the follower will react by creating her own base stations and renting some leader{\textquoteright}s stations. Each customer patronizes an operator with the highest speed of connection for him. Each operator aims to maximize own profit. We provide a formulation of this game as a bi-level nonlinear integer programming problem, where the leader and the follower maximize their own profits at the first and second levels, respectively and the customers move from one operator to another until the Nash equilibrium is reached. Local search heuristics for this problem are designed and tested on randomly generated and real data. Computational experiments show high efficiency of the approach.",
keywords = "Bi-level programming, Cellular network, Competitive location, Stackelberg game",
author = "Ivan Davydov and Yury Kochetov and Stephan Dempe",
year = "2018",
month = mar,
day = "1",
language = "English",
volume = "16",
pages = "130--143",
journal = "International Journal of Artificial Intelligence",
issn = "0974-0635",
publisher = "Indian Society for Development and Environment Research",
number = "1",

}

RIS

TY - JOUR

T1 - Local search approach for the competitive facility location problem in mobile networks

AU - Davydov, Ivan

AU - Kochetov, Yury

AU - Dempe, Stephan

PY - 2018/3/1

Y1 - 2018/3/1

N2 - We present a new leader-follower facility location game for 5G high-speed networks. Two mobile operators, the leader and the follower, compete to attract customers of high-speed internet connection. The leader acts first by opening some base stations, anticipating that the follower will react by creating her own base stations and renting some leader’s stations. Each customer patronizes an operator with the highest speed of connection for him. Each operator aims to maximize own profit. We provide a formulation of this game as a bi-level nonlinear integer programming problem, where the leader and the follower maximize their own profits at the first and second levels, respectively and the customers move from one operator to another until the Nash equilibrium is reached. Local search heuristics for this problem are designed and tested on randomly generated and real data. Computational experiments show high efficiency of the approach.

AB - We present a new leader-follower facility location game for 5G high-speed networks. Two mobile operators, the leader and the follower, compete to attract customers of high-speed internet connection. The leader acts first by opening some base stations, anticipating that the follower will react by creating her own base stations and renting some leader’s stations. Each customer patronizes an operator with the highest speed of connection for him. Each operator aims to maximize own profit. We provide a formulation of this game as a bi-level nonlinear integer programming problem, where the leader and the follower maximize their own profits at the first and second levels, respectively and the customers move from one operator to another until the Nash equilibrium is reached. Local search heuristics for this problem are designed and tested on randomly generated and real data. Computational experiments show high efficiency of the approach.

KW - Bi-level programming

KW - Cellular network

KW - Competitive location

KW - Stackelberg game

UR - http://www.scopus.com/inward/record.url?scp=85041833713&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85041833713

VL - 16

SP - 130

EP - 143

JO - International Journal of Artificial Intelligence

JF - International Journal of Artificial Intelligence

SN - 0974-0635

IS - 1

ER -

ID: 10420636