Location equilibria for a continuous competitive facility location problem under delivered pricing

被引:29
作者
Fernandez, Jose [1 ]
Salhi, Said [2 ]
Toth, Boglarka G. [3 ]
机构
[1] Univ Murcia, Fac Math, Dept Stat & Operat Res, Murcia 30100, Spain
[2] Univ Kent, Kent Business Sch, Ctr Logist & Heurist Optimizat, Canterbury CT2 7PE, Kent, England
[3] Budapest Univ Technol & Econ, Dept Differential Equat, Budapest, Hungary
关键词
Continuous location; Delivered pricing; Location-price game; Interval branch-and-bound method; Weiszfeld algorithm; MODEL; STABILITY;
D O I
10.1016/j.cor.2013.08.004
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The problem of finding location equilibria of a location-price game where firms first select their locations and then set delivered prices in order to maximise their profits is investigated. Assuming that firms set the equilibrium prices in the second stage, the game can be reduced to a location game for which a global minimiser of the social cost is a location equilibrium, provided that the demand is completely inelastic and the marginal production cost is constant. When the set of feasible locations is a region of the plane the minimisation of the social cost becomes a hard-to-solve global optimisation problem. We propose an exact interval branch-and-bound algorithm suitable for small and medium size problems and an alternating Weiszfeld-like heuristic for larger instances. The latter approach is based on a new iterative formula for which the validity of the descent property is proved. The proposed heuristic performs extremely well against the exact method when tested on small to medium size instances while requiring a tiny fraction of its computational time. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:185 / 195
页数:11
相关论文
共 40 条
[1]  
[Anonymous], ANN OPERATIONS RES
[2]  
[Anonymous], 1995, C++ Toolbox for Verified Computing I, Basic Numerical Problems
[3]  
[Anonymous], 2004, TOP
[4]  
[Anonymous], 1996, Rigorous global search: continuous problems. Nonconvex optimization and its applications
[5]  
[Anonymous], 1992, Handbook of game theory with economic applications
[6]   Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem [J].
Brimberg, J ;
Hansen, P ;
Mladenovic, N ;
Taillard, ED .
OPERATIONS RESEARCH, 2000, 48 (03) :444-460
[7]  
Brimberg J., 2008, Int. J. Oper. Res. Taichung, V5, P1
[8]   A new heuristic for solving the p-median problem in the plane [J].
Brimberg, Jack ;
Drezner, Zvi .
COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (01) :427-437
[9]   HEURISTIC METHODS FOR LOCATION-ALLOCATION PROBLEMS .1. INTRODUCTION [J].
COOPER, L .
SIAM REVIEW, 1964, 6 (01) :37-&
[10]   HOTELLINGS STABILITY IN COMPETITION [J].
DASPREMONT, C ;
GABSZEWICZ, JJ ;
THISSE, JF .
ECONOMETRICA, 1979, 47 (05) :1145-1150