Isodistant points in competitive network facility location

Abstract

An isodistant point is any point on a network which is located at a predetermined distance from some node. For some competitive facility location problems on a network, it is verified that optimal (or near-optimal) locations are found in the set of nodes and isodistant points (or points in the vicinity of isodistant points). While the nodes are known, the isodistant points have to be determined for each problem. Surprisingly, no algorithm has been proposed to generate the isodistant points on a network. In this paper, we present a variety of such problems and propose an algorithm to find all isodistant points for given threshold distances associated with the nodes. The number of isodistant points is upper bounded by nm, where n and m are the number of nodes and the number of edges, respectively. Computational experiments are presented which show that isodistant points can be generated in short run time and the number of such points is much smaller than nm. Thus, for networks of moderate size, it is possible to find optimal (or near-optimal) solutions through the Integer Linear Programming formulations corresponding to the discrete version of such problems, in which a finite set of points are taken as location candidates.

This is a preview of subscription content, access via your institution.

References

  1. D’Aspremont C, Gabszewicz J, Thisse JF (1979) On Hotelling’s Stability in Competition. Econometrica 47:1145–1150

    Article  Google Scholar 

  2. Dorta-González P, Santos-Peñate DR, Suárez-Vega R (2005) Spatial competition in networks under delivered pricing. Pap Reg Sci 84:271–280

    Article  Google Scholar 

  3. Eiselt HA (1992) Hotelling’s duopoly on a tree. Ann Oper Res 40:195–207

    Article  Google Scholar 

  4. Eiselt HA, Laporte G (1988) Location of a new facility in the presence of weights. Asia-Pac J Oper Res 15:160–165

    Google Scholar 

  5. Eiselt HA, Laporte G (1989) The maximum capture problem in a weighted network. J Reg Sci 29:433–439

    Article  Google Scholar 

  6. Eiselt HA, Laporte G, Thisse JF (1993) Competitive location models: A framework and bibliography. Transp Sci 27:44–54

    Article  Google Scholar 

  7. Fernández P, Pelegrín B, García MD, Peeters P (2005) A discrete long-term location-price problem under the assumption of discriminatory pricing: Formulations and parametric analysis. Eur J Oper Res 179:1050–1062

    Article  Google Scholar 

  8. Friesz TL, Miller T, Tobin RL (1988) Competitive network facility location models: A survey. Pap Reg Sci Assoc 65:47–57

    Article  Google Scholar 

  9. Gabszewicz JJ, Thisse JF (1992) Location. In: Aumann R, Hart S (eds) Handbook of game theory with economic applications. Elsevier, Amsterdam, pp 281–304

    Chapter  Google Scholar 

  10. García MD, Pelegrín B (2003) All Stackelberg location in the Hotellingś duopoly model on a tree with parametric prices. Ann Oper Res 122:177–192

    Article  Google Scholar 

  11. García MD, Fernández P, Pelegrín B (2004) On price competition in location-price models with spatially separated markets. TOP 12:351–374

    Article  Google Scholar 

  12. Gondran M, Minoux M, Vajda S (1984) Graphs and algorithms. Wiley, New York

    Google Scholar 

  13. Hakimi L (1983) On locating new facilities in a competitive environment. Eur J Oper Res 12:29–35

    Article  Google Scholar 

  14. Hakimi L (1990) Location with spatial interactions: Competitive locations and games. In: Mirchandani P, Francis R (eds) Discrete location theory. Wiley, New York, pp 439–478

    Google Scholar 

  15. Hoover EM (1936) Spatial price discrimination. Rev Econ Stud 4:182–191

    Google Scholar 

  16. Hotelling H (1929) Stability in competition. Econ J 39:41–57

    Article  Google Scholar 

  17. Huff DL (1964) Defining and estimating a trade area. J Mark 28:34–48

    Article  Google Scholar 

  18. Huff DL (1966) A programmed solution for approximating an optimum retail location. Land Econ 42:293–303

    Article  Google Scholar 

  19. Lederer PJ (2003) Competitive delivered spatial pricing. Netw Spat Econ 3:421–439

    Article  Google Scholar 

  20. Lederer PJ, Thisse JF (1990) Competitive location on networks under delivered pricing. Oper Res Lett 9:147–153

    Article  Google Scholar 

  21. Osborne MJ, Pitchik C (1987) Equilibrium in Hotellingś model of spatial competition. Econometrica 55:911–922

    Article  Google Scholar 

  22. Peeters PH, Plastria F (1998) Discretization results for the Huff and Pareto–Huff competitive location models on networks. Top 2:247–260

    Article  Google Scholar 

  23. Pelegrín B, Fernández P, Suárez R, García MD (2006) Single facility location on a network under mill and delivered pricing. IMA J Manag Math 17:373–385

    Article  Google Scholar 

  24. Plastria F (2001) Static competitive facility location: An overview of optimization approaches. Eur J Oper Res 129:461–470

    Article  Google Scholar 

  25. Plastria F, Vanhaverbeke L (2009) Maximal covering location problem with price decision for revenue maximization in a competitive environment. OR Spektrum 31:555–571

    Article  Google Scholar 

  26. Revelle CS (1986) The maximum capture or “sphere of influence” location problem: Hotelling revisited on a network. J Reg Sci 26:343–358

    Article  Google Scholar 

  27. Revelle CS, Eiselt HA (2005) Location analysis: A synthesis and a survey. Eur J Oper Res 165:1–19

    Article  Google Scholar 

  28. Serra D, ReVelle C (1995) Competitive location in discrete space. In: Drezner Z (ed) Facility location: a survey of applications and methods. Springer, Berlin, pp 367–386

    Google Scholar 

  29. Serra D, ReVelle C (1999) Competitive location and pricing on networks. Geogr Anal 31:109–129

    Article  Google Scholar 

  30. Suárez-Vega R, Santos-Peñate DR, Dorta-González P (2004a) Competitive multifacility location on networks: The (r|X p )-medianoid problem. J Reg Sci 44:569–588

    Article  Google Scholar 

  31. Suárez-Vega R, Santos-Peñate DR, Dorta-González P (2004b) Discretization and resolution of the (r|X p )-medianoid problem involving quality criteria. Top 12:111–133

    Article  Google Scholar 

  32. Suárez-Vega R, Santos-Peñate DR, Dorta-González P (2007) The follower location problem with attraction thresholds. Pap Reg Sci 86:123–137

    Article  Google Scholar 

  33. Znang S (2001) On a profit maximizing location model. Ann Oper Res 103:251–260

    Article  Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Rafael Suárez-Vega.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Pelegrín, B., Suárez-Vega, R. & Cano, S. Isodistant points in competitive network facility location. TOP 20, 639–660 (2012). https://doi.org/10.1007/s11750-010-0148-6

Download citation

Keywords

  • Facility location
  • Threshold distances
  • Spatial competition

Mathematics Subject Classification (2000)

  • 90B80
  • 90B85