Volume 17, No 6, 2010, P. 3-19

UDC 519.725
V. L. Beresnev, A. A. Melnikov
Approximation algorithms for the competitive facility location problem

The paper deals with the competitive facility location problem, where two players, the leader and the follower, sequentially establish their facilities and every consumer chooses one of the established facilities in accordance with his own preference. The problem consists in placing the leader’s facilities so as to acquire the maximal profit, taking the follower’s facilities placing into account, who seeks to maximize his profit as well. The problem is formulated in terms of bi-level integer programming. The paper offers a method for calculating the upper bound for the leader’s maximum profit value. The corresponding algorithm consists in designing the classical maximization facility location problem and finding its optimal solution. Along with the calculation of the upper bound, an initial approximate solution for the problem of competitive facility location is generated. The paper offers local search algorithms for improving the initial approximate solution and gives the results of a computational experiment employing the proposed algorithms. The experiment makes it possible to estimate the precision of the obtained approximate solutions and a comparative evaluation of the quality of the algorithms under examination for designing approximate solutions of the examined problem.
Tab. 1, bibliogr. 13.

Keywords: bi-level programming problem, optimal uncooperative solution, upper bound, approximate solution, local search.

Beresnev Vladimir Leonidovich 1,2
Mel’nikov Andrey Andreevich 2

1. S. L. Sobolev Institute of Mathematics, SB RAS,
4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
2. Novosibirsk State University,
2 Pirogov St., 630090 Novosibirsk, Russia
e-mail: beresnev@math.nsc.ru, a.a.melnikov@hotmail.com

 © Sobolev Institute of Mathematics, 2015