Solving a Huff-like Stackelberg location problem on networks

详细信息    查看全文

• 作者：Boglárka G.-Tóth ; Kristóf Kovács
• 关键词：Stackelberg problem ; Bilevel optimization ; Branch and Bound ; Interval analysis ; DC decomposition
• 刊名：Journal of Global Optimization
• 出版年：2016
• 出版时间：February 2016
• 年：2016
• 卷：64
• 期：2
• 页码：233-247
• 全文大小：742 KB
• 参考文献：1.Blanquero, R., Carrizosa, E.: Continuous location problems and big triangle small triangle: constructing better bounds. J. Glob. Optim. 45(3), 389–402 (2009)CrossRef MathSciNet
  2.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)
  3.Dempe, S.: Foundations of Bilevel Programming. Springer, New York (2002)
  4.Drezner, T., Drezner, Z.: Facility location in anticipation of future competition. Locat. Sci. 6(1–4), 155–173 (1998)CrossRef
  5.Hansen, E., Walster, G.W.: Global Optimization Using Interval Analysis: Revised and Expanded, vol. 264. CRC Press, Boca Raton (2003)
  6.Horst, R., Thoai, N.V.: Dc programming: overview. J. Optim. Theory Appl. 103(1), 1–43 (1999)CrossRef MathSciNet
  7.Knüppel, O.: PROFIL/BIAS—a fast interval library. Computing 1(53), 277–287 (1993)
  8.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)CrossRef
  9.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)CrossRef
  10.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)CrossRef
  11.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)CrossRef MathSciNet
  12.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)CrossRef MathSciNet
  13.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)CrossRef
  
• 作者单位：Boglárka G.-Tóth (1)
  Kristóf Kovács (1)
  
  1. Department of Differential Equations, Budapest University of Technology and Economics, Budapest, Hungary
  
• 刊物类别：Business and Economics
• 刊物主题：Economics
  Operation Research and Decision Theory
  Computer Science, general
  Real Functions
  Optimization
  
• 出版者：Springer Netherlands
• ISSN：1573-2916

文摘

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. Keywords Stackelberg problem Bilevel optimization Branch and Bound Interval analysis DC decomposition