Abstract
Modelling the location decision of two competing firms that intend to build a new facility in a planar market can be done by a Huff-like Stackelberg location problem. In a Huff-like model, the market share captured by a firm is given by a gravity model determined by distance calculations to facilities. In a Stackelberg model, the leader is the firm that locates first and takes into account the actions of the competing chain (follower) locating a new facility after the leader. The follower problem is known to be a hard global optimisation problem. The leader problem is even harder, since the leader has to decide on location given the optimal action of the follower. So far, in literature only heuristic approaches have been tested to solve the leader problem. Our research question is to solve the leader problem rigorously in the sense of having a guarantee on the reached accuracy. To answer this question, we develop a branch-and-bound approach. Essentially, the bounding is based on the zero sum concept: what is gain for one chain is loss for the other. We also discuss several ways of creating bounds for the underlying (follower) sub-problems, and show their performance for numerical cases.
Article PDF
Similar content being viewed by others
References
Bhadury J, Eiselt H, Jamarillo J (2003) An alternating heuristic for medianoid and centroid problems in the plane. Comput Operat Res 30: 553–565
Casado LG, Hendrix EMT, García I (2007) Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints. J Global Optimi 39(2): 577–593. doi:10.1007/s10.898-007-9157-x
Drezner T (1994) Locating a single new facility among existing unequally attractive facilities. J Reg Sci 34(2): 237–252
Drezner T, Drezner Z (1994) Optimal continuous location of a retail facility, facility attractiveness and market share: an interactive model. J Retail 70: 49–64
Drezner T, Drezner Z (1997) Replacing continuous demand with discrete demand in a competitive location model. Naval Res Logist 44: 81–95
Drezner T, Drezner Z (1998) Facility location in anticipation of future competition. Location Sci 6: 155–173
Drezner T, Drezner Z (2004) Finding the optimal solution to the huff based competitive location model. Comput Manage Sci 1: 193–208
Drezner Z (1982) Competitive location strategies for two facilities. Reg Sci Urban Econ 12: 485–493
Eiselt H, Laporte G (1996) Sequential location problems. Eur J Opera Res 96: 217–231
Eiselt H, Laporte G, Thisse JF (1993) Competitive location models: a framework and bibliography. Transp Sci 27: 44–54
Fernández J, Pelegrín B, Plastria F, Tóth B (2007) Solving a huff-like competitive location and design model for profit maximization in the plane. Eur J Oper Res 179: 1274–1287
Hakimi S (1983) On locating new facilities in a competitive environment. Eur J Oper Res 12: 29–35
Ibaraki T (1976) Theoretical comparisons of search strategies in branch and bound algorithms. Int J Comput Inform Sci 5: 315–344
Mitten LG (1970) Branch and bound methods: general formulation and properties. Oper Res 18: 24–34
Plastria F (1992) Gbsss, the generalized big square small square method for planar single facility location. Eur J Oper Res 62: 163–74
Plastria F (1997) Profit maximising single competitive facility location in the plane. Stud Locat Anal 11: 115–126
Plastria F (2001) Static competitive facility location: an overview of optimisation approaches. Eur J Oper Res 129: 461–470
Plastria F, Carrizosa E (2004) Optimal location and design of a competitive facility. Mathe Program 100: 247–265
Tuy H, Al-Khayyal F, Zhou F (1995) A d.c. optimization method for single facility location problems. J Global Optim 7: 209–227
Open Access
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work has been supported by the Ministry of Education and Science of Spain through grant SEJ2005/06273/ECON. M. Elena Sáz was supported by a junior research grant of Mansholt Graduate School (Wageningen Universiteit).
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Elena Sáiz, M., Hendrix, E.M.T., Fernández, J. et al. On a branch-and-bound approach for a Huff-like Stackelberg location problem. OR Spectrum 31, 679–705 (2009). https://doi.org/10.1007/s00291-008-0133-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-008-0133-8