×

A leader-follower game in competitive facility location. (English) Zbl 1251.90242

Summary: We address the problem of locating new facilities of a firm or franchise that enters a market where a competitor operates existing facilities. The goal of the new entrant firm is to decide the location and attractiveness of its new facilities that maximize its profit. The competitor can react by opening new facilities, closing existing ones, and adjusting the attractiveness levels of its existing facilities, with the aim of maximizing its own profit. The demand is assumed to be aggregated at certain points in the plane and the new facilities of both the firm and the competitor can be located at predetermined candidate sites. We employ the gravity-based rule in modeling the behavior of the customers where the probability that a customer visits a certain facility is proportional to the facility attractiveness and inversely proportional to the distance between the facility site and demand point. We formulate a bilevel mixed-integer nonlinear programming model where the firm entering the market is the leader and the competitor is the follower. We propose heuristics that combine tabu search with exact solution methods.

MSC:

90B80 Discrete location and assignment
91A65 Hierarchical games (including Stackelberg games)
91A80 Applications of game theory
90C11 Mixed integer programming
90C30 Nonlinear programming
90C59 Approximation methods and heuristics in mathematical programming

Software:

KNITRO; Tabu search
Full Text: DOI

References:

[1] Adjiman, C. S.; Androulakis, I. P.; Floudas, C. A., Global optimization of MINLP problems in process synthesis and design, Computers and Chemical Engineering, 21, 445-450 (1997)
[2] Adjiman, C. S.; Dallwig, S.; Floudas, C. A.; Neumaier, A., A global optimization method, \( \alpha \operatorname{BB} \), for general twice-differentiable constrained NLPs-I. Theoretical advances, Computers and Chemical Engineering, 22, 9, 1137-1158 (1998)
[3] Adjiman, C. S.; Androulakis, I. P.; Floudas, C. A., A global optimization method, \( \alpha \operatorname{BB} \), for general twice-differentiable constrained NLPs-II. Implementation and computational results, Computers and Chemical Engineering, 22, 9, 1159-1179 (1998)
[4] Adjiman, C. S.; Androulakis, I. P.; Floudas, C. A., Global optimization of mixed-integer nonlinear problems, AIChE Journal, 46, 176-248 (2000)
[5] Androulakis, I. P.; Maranas, C. D.; Floudas, C. A., \( \alpha \operatorname{BB} \): a global optimization method for general constrained nonconvex problems, Journal of Global Optimization, 7, 337-363 (1995) · Zbl 0846.90087
[6] Bard, J. F., Practical bilevel optimization algorithms and applications (2004), Kluwer Academic Publishers
[7] Bertsekas, D. P., Nonlinear programming (1995), Athena Scientific: Athena Scientific Boston, USA · Zbl 0935.90037
[8] Bhadury, J.; Eiselt, H. A.; Jaramillo, J. H., An alternating heuristic for medianoid and centroid problems in the plane, Computers and Operations Research, 30, 553-565 (2003) · Zbl 1026.90053
[9] Drezner, Z., Competitive location strategies for two facilities, Regional Science and Urban Economics, 12, 485-493 (1982)
[10] Drezner, T.; Drezner, Z., Facility location in anticipation of future competition, Location Science, 6, 155-173 (1998)
[11] Eiselt, H. A.; Laporte, G., Sequential location problems, European Journal of Operational Research, 96, 2, 217-231 (1997) · Zbl 0917.90225
[12] Fischer, K., Sequential discrete p-facility models for competitive location planning, Annals of Operations Research, 111, 1-4, 253-270 (2002) · Zbl 1013.90082
[13] Floudas, C. A., Deterministic global optimization: theory, methods, and applications (2000), Kluwer Academic Publishers · Zbl 1037.90002
[14] Glover, F.; Laguna, M.; Martí, R., Principles of Tabu search, (Gonzalez, T., Handbook on approximation algorithms and metaheuristics (2007), Chapman & Hall/CRC: Chapman & Hall/CRC Boca Raton)
[15] Grossmann, I. E.; Floudas, C. A., Active constraint strategy for flexibility analysis in chemical processes, Computers and Chemical Engineering, 11, 675-693 (1987)
[16] Huff, D. L., Defining and estimating a trade area, Journal of Marketing, 28, 34-38 (1964)
[17] Huff, D. L., A programmed solution for approximating an optimum retail location, Land Economics, 42, 293-303 (1966)
[18] Küçükaydın H, Aras N, Altınel İK. A hybrid tabu search heuristic for a bilevel competitive facility location model. In: Hybrid metaheuristics, Lecture notes in computer science LNCS 6373, Proceedings of 7th international workshop on hybrid metaheuristics HM2010, Vienna, Austria. p. 31-45.; Küçükaydın H, Aras N, Altınel İK. A hybrid tabu search heuristic for a bilevel competitive facility location model. In: Hybrid metaheuristics, Lecture notes in computer science LNCS 6373, Proceedings of 7th international workshop on hybrid metaheuristics HM2010, Vienna, Austria. p. 31-45.
[19] Küçükaydın, H.; Aras, N.; Altınel, İ. K., Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution, European Journal of Operational Research, 208, 3, 206-220 (2011) · Zbl 1208.90104
[20] Nakanishi, M.; Cooper, L. G., Parameter estimate for multiplicative interactive choice model: least squares approach, Journal of Marketing Research, 11, 303-311 (1974)
[21] Moore, J. T.; Bard, J. F., The mixed-integer linear bilevel programming problem, Operations Research, 38, 911-921 (1990) · Zbl 0723.90090
[22] Pérez, M. D.G.; Pelegrín, B., All Stackelberg location equilibria in the Hotelling’s duopoly model on a tree with parametric prices, Annals of Operations Research, 122, 1-4, 177-192 (2003) · Zbl 1127.90388
[23] Plastria, F., Static competitive facility location: an overview of optimisation approaches, European Journal of Operational Research, 129, 3, 461-470 (2001) · Zbl 1116.90372
[24] Plastria, F.; Vanhaverbeke, L., Discrete models for competitive location with foresight, Computers and Operations Research, 35, 3, 683-700 (2008) · Zbl 1278.90276
[25] Press, W. H.; Flannery, B. P.; Teukolsky, S. A.; Vetterling, W. T., Numerical recipes: the art of scientific computing (1986), Cambridge University Press: Cambridge University Press New York · Zbl 0587.65003
[26] Reilly, W. J., The law of retail gravitation (1931), Knickerbocker Press: Knickerbocker Press New York, NY
[27] Sáiz, M. E.; Hendrix, E. M.T.; Fernández, J.; Pelegrín, B., On a branch-and-bound approach for a Huff-like Stackelberg location problem, OR Spectrum, 31, 3, 679-705 (2009) · Zbl 1163.90619
[28] Serra, D.; ReVelle, C., Market capture by two competitors: the pre-emptive location problem, Journal of Regional Science, 34, 4, 549-561 (1994)
[29] Serra, D.; ReVelle, C., Competitive location and pricing on networks, Geographical Analysis, 31, 2, 109-129 (1999)
[30] Steiner, W. J., A Stackelberg-Nash model for new product design, OR Spectrum, 48, 21-48 (2010) · Zbl 1183.91027
[31] Waltz RA, Plantenga TD. Knitro user’s manual version 6.0 Ziena optimization Inc.; 2009.; Waltz RA, Plantenga TD. Knitro user’s manual version 6.0 Ziena optimization Inc.; 2009.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.