Abstract
This work deals with a Huff-like Stackelberg problem where the leader wants to locate a facility so that its profit is maximal after the competitor (the follower) has built its facility. We assume that the follower makes a rational decision, maximizing its own profit. The inelastic demand is aggregated into the vertices of a graph, and facilities can be located along the edges. For this computationally hard problem we give a Branch and Bound algorithm using interval analysis and DC bounds. Our computational experience shows that the problem can be solved on medium sized networks in reasonable time.
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10898-015-0368-2/MediaObjects/10898_2015_368_Fig1_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10898-015-0368-2/MediaObjects/10898_2015_368_Fig2_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10898-015-0368-2/MediaObjects/10898_2015_368_Fig3_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10898-015-0368-2/MediaObjects/10898_2015_368_Fig4_HTML.gif)
Similar content being viewed by others
References
Blanquero, R., Carrizosa, E.: Continuous location problems and big triangle small triangle: constructing better bounds. J. Glob. Optim. 45(3), 389–402 (2009)
Blanquero, R., Carrizosa, E., Nogales-Gómez, A., Plastria, F.: Single-facility Huff location problems on networks. Ann. Oper. Res. 1(222), 175–195 (2014)
Dempe, S.: Foundations of Bilevel Programming. Springer, New York (2002)
Drezner, T., Drezner, Z.: Facility location in anticipation of future competition. Locat. Sci. 6(1–4), 155–173 (1998)
Hansen, E., Walster, G.W.: Global Optimization Using Interval Analysis: Revised and Expanded, vol. 264. CRC Press, Boca Raton (2003)
Horst, R., Thoai, N.V.: Dc programming: overview. J. Optim. Theory Appl. 103(1), 1–43 (1999)
Knüppel, O.: PROFIL/BIAS—a fast interval library. Computing 1(53), 277–287 (1993)
Küçükaydin, H., Aras, N., Kuban Altınel, I.: Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution. Eur. J. Oper. Res. 208(3), 206–220 (2011)
Redondo, J.L., Arrondo, A.G., Fernández, J., García, I., Ortigosa, P.M.: A two-level evolutionary algorithm for solving the facility location and design (1|1)-centroid problem on the plane with variable demand. J. Glob. Optim. 56(3), 983–1005 (2013)
Redondo, J.L., Fernández, J., García, I., Ortigosa, P.M.: Solving the facility location and design (1|1)-centroid problem via parallel algorithms. J. Supercomput. 58(3), 420–428 (2011)
Redondo, J.L., Fernández, J., García, I., Ortigosa, P.M.: Heuristics for the facility location and design (1|1)-centroid problem on the plane. Comput. Optim. Appl. 45(1), 111–141 (2010)
Saidani, N., Chu, F., Chen, H.: Competitive facility location and design with reactions of competitors already in the market. Eur. J. Oper. Res. 219(1), 9–17 (2012)
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 Spectr. 31, 679–705 (2009)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is funded by the Hungarian National Research, Development and Innovation Office—NKFIH, OTKA grant PD115554 and also by the project ICT COST Action TD1207 (EU).
Rights and permissions
About this article
Cite this article
G.-Tóth, B., Kovács, K. Solving a Huff-like Stackelberg location problem on networks. J Glob Optim 64, 233–247 (2016). https://doi.org/10.1007/s10898-015-0368-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-015-0368-2