Optimal location and design of a competitive facility

Abstract.A single facility has to be located in competition with fixed existing facilities of similar type. Demand is supposed to be concentrated at a finite number of points, and consumers patronise the facility to which they are attracted most. Attraction is expressed by some function of the quality of the facility and its distance to demand. For existing facilities quality is fixed, while quality of the new facility may be freely chosen at known costs. The total demand captured by the new facility generates income. The question is to find that location and quality for the new facility which maximises the resulting profits.It is shown that this problem is well posed as soon as consumers are novelty oriented, i.e. attraction ties are resolved in favour of the new facility. Solution of the problem then may be reduced to a bicriterion maxcovering-minquantile problem for which solution methods are known. In the planar case with Euclidean distances and a variety of attraction functions this leads to a finite algorithm polynomial in the number of consumers, whereas, for more general instances, the search of a maximal profit solution is reduced to solving a series of small-scale nonlinear optimisation problems. Alternative tie-resolution rules are finally shown to result in problems in which optimal solutions might not exist.

[1]  R. Vaughan,et al.  Urban spatial traffic patterns , 1987 .

[2]  Frank Plastria,et al.  Continuous Location Problems , 1995 .

[3]  Frank Plastria The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm , 1988 .

[4]  E. Carrizosa,et al.  LOCATION AND DESIGN OF A COMPETITIVE FACILITY FOR PROFIT MAXIMISATION , 2003 .

[5]  S. Schaible,et al.  4. Application of Generalized Concavity to Economics , 1988 .

[6]  Said Salhi,et al.  Facility Location: A Survey of Applications and Methods , 1996 .

[7]  Shuzhong Zhang,et al.  On a Profit Maximizing Location Model , 2001, Ann. Oper. Res..

[8]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[9]  Frank Plastria,et al.  Static competitive facility location: An overview of optimisation approaches , 2001, Eur. J. Oper. Res..

[10]  Gilbert Laporte,et al.  Competitive Location Models: A Framework and Bibliography , 1993, Transp. Sci..

[11]  Timothy J. Lowe,et al.  On worst-case aggregation analysis for network location problems , 1993, Ann. Oper. Res..

[12]  Frank Plastria,et al.  Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints , 1998 .

[13]  Pierre Hansen,et al.  The profit-maximizing weber problem , 1994 .

[14]  Abraham Mehrez,et al.  THE MAXIMAL COVERING LOCATION PROBLEM WITH FACILITY PLACEMENT ON THE ENTIRE PLANE , 1982 .

[15]  Gilbert Laporte,et al.  LOCATION OF A NEW FACILITY ON A LINEAR MARKET IN THE PRESCENCE OF WEIGHTS , 1987 .

[16]  Ralph E. Steuer Multiple criteria optimization , 1986 .

[17]  Tammy Drezner,et al.  Competitive Facility Location in the Plane , 1995 .

[18]  Frank Plastria,et al.  On minquantile and maxcovering optimisation , 1995, Math. Program..

[19]  Gilbert Laporte,et al.  Trading areas of facilities with different sizes , 1988 .

[20]  Z. Drezner Note-On a Modified One-Center Model , 1981 .

[21]  Tammy Drezner,et al.  Locating a single new facility among existing unequally attractive facilities , 1994 .