Abstract We study competitive location problems in a continuous setting, which facilities have to be placed rectangular domain R of normalized dimensions 1 and $$\rho \ge 1$$ ρ ≥ 1 , distances are measured according the Manhattan metric. show that famil...

This article presents a simple model to determine the location strategies of two retail firms planning to open a number of stores in a geographical market. Firms try to maximize their profit under a leader-follower type competition in which the number of stores is made endogenous by the introduction of fixed costs. A novel methodology is developed, in which firms’ strategies are defined in term...

Agglomeration of facilities that compete with each other is common in practice, which suggests the existence of forces driving facilities to locate in clusters. Shopping centers and food courts are everyday examples. Although these agglomeration forces have been adequately analyzed and explained in the economic literature, operational research location models have not taken them into considerat...

In this paper we consider a location model based on the threshold concept. We find the best location such that the probability of revenues falling short of the threshold is minimized. This objective is appropriate when a firm will not survive if its revenues fall below a known threshold. A new store is to be located. Demand is not deterministic but rather has a statistical distribution. We seek...

We adapt the competitive location model based on maximal covering to include the knowledge that a competitor will enter the market later with a single new facility. The objective is to locate facilities under a budget constraint in order to maximise the remaining market share after the competitor’s later entry. We develop mixed zero-one programming formulations for each of the following three s...

We consider a competitive facility location problem with two players. Players alternate placing points, one at a time, into the playing arena, until each of them has placed n points. The arena is then subdivided according to the nearest-neighbor rule, and the player whose points control the larger area wins. We present a winning strategy for the second player, where the arena is a circle or a l...

In this paper we propose five heuristic procedures for the solution of the multiple competitive facilities location problem. A franchise of several facilities is to be located in a trade area where competing facilities already exist. The objective is to maximize the market share captured by the franchise as a whole. We perform extensive computational tests and conclude that a two-step heuristic...

We consider a competitive facility location problem with two players. Players alternate placing points, one at a time, into the playing arena, until each of them has placed n points. The arena is then subdivided according to the nearest-neighbor rule, and the player whose points control the larger area wins. We present a winning strategy for the second player, where the arena is a circle or a l...