Resolución de una extensión del problema del líder-Seguidor mediante programación lineal
- Clara M. Campos Rodríguez 1
- José A. Moreno Pérez 1
- Dolores R Santos Peñate 2
- 1 Universidad de La Laguna.
- 2 Universidad de Las Palmas de Gran Canaria.
ISSN: 2171-892X
Year of publication: 2011
Issue: 19
Type: Article
More publications in: Anales de ASEPUMA
Abstract
In this paper we consider a version of the leader-follower location model that includes costs of the locations. These costs appear in a budgetary constraint that replaces the condition that bounds the number of facility centers for each competing firm. The problem is to determine optimal strategies for each firm, the leader and the follower, which enter the market sequentially trying to maximize their market share. The existing demand is satisfied by the rival firms according to the proximity between clients and facilities. The proposed formulation incorporates a different cost for each location for the facilities of both firms. The objective of the follower, when the location of the leader is known, is to maximize its captured demand or market share. The optimization problem of the leader is to minimize the maximum market share that the follower would capture. Both problems are formulated as linear programming problems.
Bibliographic References
- S.S. Benati, G. Laporte, Tabu search algorithms for the (r|Xp)-medianoid and (r|p)- centroid problems. Location Science 2 (1994) 193-204.
- J. Bhadury, H.A. Eiselt, J.H. Jaramillo, An alternating heuristic for medianoid and centroid problems in the plane. Computers & Operations Research 30 (2003) 553- 565.
- S. Daskin, Network and discrete location. Models, algorithms and applications. (Wiley, New York, 1995).
- G. Dobson, U.S. Karmarkar, Competitive location on a network, Operations Research 35 (1987) 565-574
- H.A. Eiselt, G. Laporte, Competitive spatial models, European Journal of Operational Research 39 (1989) 231-242.
- H.A. Eiselt, G. Laporte, Sequential location problems, European Journal of Operational Research 96 (1996) 217-231
- H.A. Eiselt, G. Laporte, J.F.Thisse, Competitive location models: A framework and bibliography. Transportation Science 27(1) (1993) 44-54
- T.L. Friesz, T. Miller and R.L. Tobin, Competitive network facility location models: a survey. Papers of the Regional Science Association 65 (1988) 47-57
- R. Gandhi, S. Khuller, A. Srinivasan, Approximation algorithms for partial covering problems, Journal of Algorithms 53(1) (2004) 55–84
- S.L. Hakimi, On locating new facilities in a competitive environment, European Journal of Operational Research 12 (1983) 29-35
- S.L. Hakimi, Location with spatial interactions: competitive locations and games. In Mirchandani PB, Francis RL (ed) Discrete Location Theory (Wiley, New York, 1990) 439-478.
- F. Plastria, Static competitive facility location: an overview of optimization approaches, European Journal of Operational Research (1990) 129:461-470.
- J.L. Redondo, J. Fernández, I. García, P.M. Ortigosa, Heuristics for the facility location and design (1|1)-centroid problem on the plane. Computational Optimization and Applications, 45(1) 2010.
- C. ReVelle, The maximum capture or sphere of influence location problem: Hotelling revisited on a network, Journal of Regional Science 26(2) (1986) 343-358
- D.R. Santos-Peñate, R.R. Suárez-Vega, P. Dorta-González, The leader-follower location model, Networks and Spatial Economics (2007) 7:45-61.
- D. Serra, C. ReVelle, Market capture by two competitors: the preemptive location problem, Journal of Regional Science 34(4) (1994) 549-561.
- D. Serra, C. ReVelle, Competitive location in discrete space, in Z. Drezner (ed.) Facility location: A survey of applications and methods (Springer, Berlin 1995) 367-386.
- J. Spoerhase, H.C. Wirth, (r|p)-centroid problems on paths and trees, Theoretical Computer Science 410(47-49), 5128-5137 (2009)
- R. Suárez-Vega, D.R. Santos-Peñate, P. Dorta-González, Competitive multifacility location on networks: the (r|Xp)-medianoid problem. Journal of Regional Science 44(3) (2004) 569-588