Consider a chain as leader that wants to open p new facilities in a linear market, like metro. In this market, there is a competitor, called follower. The leader and the follower have established some facilities in advance. When the leader opens p new facilities, its competitor, follower, reacts the leader’s action and opens r new facilities. The optimal locations for leader and follower are chosen among predefined potential locations. Demand is considered as demand points and is assumed inelastic. Considering huff model, demand points are probabilistically absorbed by all facilities. The leader’s objective is maximization of its market share after opening follower’s new facilities. For solving leader problem, first the follower’s problem is solved for all leader’s potential locations and the best location for leader is obtained and then, a heuristic model is proposed for leader problem when the leader and the follower want to open one new facility. Computational results show that the proposed method is efficient for large scale problems.

Ashtiani, M., Makui, A & Ramezanian, R. (2011). Huff-type competitive facility location model with foresight in a discrete space.Management Science Letters, 1(1), 1-12.

Bhadury, J., Eiselt, H. A., Jaramillo, J. H. (2003). An alternating heuristic for medianoid and centroid problems in the plane. Computers & Operations Research, 30(4), 553–565.

Drezner, T., Drezner, Z. (1998). Facility location in anticipation of future competition. Location Science. 6(1), 155–173.

Drezner, T., & Drezner, Z. (2002). Retail facility location under changing market conditions. IMA Journal of Management Mathematics, 13(4), 283–302.

Drezner, Z. (1982). Competitive Location Strategies for Two Facilities. Regional Science and Economics, 12, 485–493.

Drezner, Z (1995). Facility location: A survey of applications and theory. Springer, Berlin

Eiselt, H.A. and G. Laporte. (1996). Sequential Location Problems. European Journal of Operational Research, 96, 217–231.

García, M.D., & B. Pelegrín. (1997). Two-Stage Competitive Location on a Tree. Studies on Locational Analysis, 11, 101–114.

Hakimi, S.L (1983). On locating new facilities in a competitive environment. European Journal of Operational Research, 12 (1), 29-35.

Hakimi, S. L. (1986). p-Medians Theorems for Competitive Location. Annals of Operations Research, 5, 79–88.

Hakimi, S. L. (1990). Locations with Spatial Interactions: Competitive Locations and Games. In: P. Mirchandani and R. Francis (eds.), Discrete Location Theory. New York: Wiley-Interscience, chapter 10, 439–478.

Hotelling, H, (1929). Stability in competition. The Economic Journal. 30, 41-57.

Huff, D. L. (1964). Defining and estimating a trading area. The Journal of Marketing, 28(3), 34–38

Infante-Macias, R & Mu˜noz-Perez, J. (1995). Competitive location with rectilinear distances. European Journal of Operational Research, 80, 77–85.

Redondo, J. L., Fernández, J., García, I., & Ortigosa, P. M. (2010). Heuristics for the facility location and design (1|1)-centroid problem on the plane. Computational Optimization and Applications, 45, 111–141.

Sáiz, M. E., Hendrix, E. M. T., Fernández, J., & Pelegrín, B. (2009). On a branch-and-bound approach for a Huff-like Stackelberg location problem. OR Spectrum, 31, 679–705.

Serra, D. & ReVelle, C. (1994). Maximum Capture by Two Competitors: The Preemptive Capture Problem. Journal of Regional Science, 34, 549–571.