IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v20y2012i3p639-660.html
   My bibliography  Save this article

Isodistant points in competitive network facility location

Author

Listed:
  • Blas Pelegrín
  • Rafael Suárez-Vega
  • Saúl Cano

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. Copyright Sociedad de Estadística e Investigación Operativa 2012

Suggested Citation

  • Blas Pelegrín & Rafael Suárez-Vega & Saúl Cano, 2012. "Isodistant points in competitive network facility location," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(3), pages 639-660, October.
    • Handle: RePEc:spr:topjnl:v:20:y:2012:i:3:p:639-660
    DOI: 10.1007/s11750-010-0148-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11750-010-0148-6
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11750-010-0148-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hakimi, S. Louis, 1983. "On locating new facilities in a competitive environment," European Journal of Operational Research, Elsevier, vol. 12(1), pages 29-35, January.
    2. R.J. Aumann & S. Hart (ed.), 2002. "Handbook of Game Theory with Economic Applications," Handbook of Game Theory with Economic Applications, Elsevier, edition 1, volume 3, number 3.
    3. Osborne, Martin J & Pitchik, Carolyn, 1987. "Equilibrium in Hotelling's Model of Spatial Competition," Econometrica, Econometric Society, vol. 55(4), pages 911-922, July.
    4. LEDERER, Philip J. & THISSE, Jacques-François, 1990. "Competitive location on networks under delivered pricing," LIDAM Reprints CORE 893, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Peter Peeters & Frank Plastria, 1998. "Discretization results for the Huff and Pareto-Huff competitive location models on networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 6(2), pages 247-260, December.
    6. ReVelle, C. S. & Eiselt, H. A., 2005. "Location analysis: A synthesis and survey," European Journal of Operational Research, Elsevier, vol. 165(1), pages 1-19, August.
    7. David L. Huff, 1966. "A Programmed Solution for Approximating an Optimum Retail Location," Land Economics, University of Wisconsin Press, vol. 42(3), pages 293-303.
    8. Plastria, Frank, 2001. "Static competitive facility location: An overview of optimisation approaches," European Journal of Operational Research, Elsevier, vol. 129(3), pages 461-470, March.
    9. H. A. Eiselt & Gilbert Laporte & Jacques-François Thisse, 1993. "Competitive Location Models: A Framework and Bibliography," Transportation Science, INFORMS, vol. 27(1), pages 44-54, February.
    10. Daniel Serra & Charles Revelle, 1997. "Competitive location and pricing on networks," Economics Working Papers 219, Department of Economics and Business, Universitat Pompeu Fabra.
    11. Rafael Suárez‐Vega & Dolores R. Santos‐Peñate & Pablo Dorta‐González, 2007. "The follower location problem with attraction thresholds," Papers in Regional Science, Wiley Blackwell, vol. 86(1), pages 123-137, March.
    12. Daniel Serra & Charles Revelle, 1994. "Competitive location in discrete space," Economics Working Papers 96, Department of Economics and Business, Universitat Pompeu Fabra.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Blas Pelegrín & Pascual Fernández & María Dolores García, 2018. "Computation of Multi-facility Location Nash Equilibria on a Network Under Quantity Competition," Networks and Spatial Economics, Springer, vol. 18(4), pages 999-1017, December.
    2. Mercedes Pelegrín & Blas Pelegrín, 2017. "Nash equilibria in location games on a network," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(3), pages 775-791, July.
    3. Rafael Suárez-Vega & Dolores Santos-Peñate & Pablo Dorta-González, 2014. "Location and quality selection for new facilities on a network market," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 52(2), pages 537-560, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kress, Dominik & Pesch, Erwin, 2012. "Sequential competitive location on networks," European Journal of Operational Research, Elsevier, vol. 217(3), pages 483-499.
    2. Díaz-Báñez, J.M. & Heredia, M. & Pelegrín, B. & Pérez-Lantero, P. & Ventura, I., 2011. "Finding all pure strategy Nash equilibria in a planar location game," European Journal of Operational Research, Elsevier, vol. 214(1), pages 91-98, October.
    3. Drezner, Zvi & Eiselt, H.A., 2024. "Competitive location models: A review," European Journal of Operational Research, Elsevier, vol. 316(1), pages 5-18.
    4. Haase, Knut & Hoppe, Mirko, 2008. "Standortplanung unter Wettbewerb - Teil 1: Grundlagen," Discussion Papers 2/2008, Technische Universität Dresden, "Friedrich List" Faculty of Transport and Traffic Sciences, Institute of Transport and Economics.
    5. María García & Blas Pelegrín & Pascual Fernández, 2011. "Location strategy for a firm under competitive delivered prices," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 47(1), pages 1-23, August.
    6. Plastria, Frank, 2001. "Static competitive facility location: An overview of optimisation approaches," European Journal of Operational Research, Elsevier, vol. 129(3), pages 461-470, March.
    7. Abdullah Dasci & Gilbert Laporte, 2005. "A Continuous Model for Multistore Competitive Location," Operations Research, INFORMS, vol. 53(2), pages 263-280, April.
    8. Fernandez, Pascual & Pelegrin, Blas & Garcia Perez, Maria Dolores & Peeters, Peter H., 2007. "A discrete long-term location-price problem under the assumption of discriminatory pricing: Formulations and parametric analysis," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1050-1062, June.
    9. B Pelegrín-Pelegrín & P Dorta-González & P Fernández-Hernández, 2011. "Finding location equilibria for competing firms under delivered pricing," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 729-741, April.
    10. ReVelle, C. S. & Eiselt, H. A., 2005. "Location analysis: A synthesis and survey," European Journal of Operational Research, Elsevier, vol. 165(1), pages 1-19, August.
    11. Buechel, Berno & Roehl, Nils, 2015. "Robust equilibria in location games," European Journal of Operational Research, Elsevier, vol. 240(2), pages 505-517.
    12. Mercedes Pelegrín & Blas Pelegrín, 2017. "Nash equilibria in location games on a network," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(3), pages 775-791, July.
    13. Rafael Suárez‐Vega & Dolores R. Santos‐Peñate & Pablo Dorta‐González, 2004. "Competitive Multifacility Location on Networks: the (r∣Xp)‐Medianoid Problem," Journal of Regional Science, Wiley Blackwell, vol. 44(3), pages 569-588, August.
    14. Dilek, Hande & Karaer, Özgen & Nadar, Emre, 2018. "Retail location competition under carbon penalty," European Journal of Operational Research, Elsevier, vol. 269(1), pages 146-158.
    15. Tammy Drezner, 2009. "Location of retail facilities under conditions of uncertainty," Annals of Operations Research, Springer, vol. 167(1), pages 107-120, March.
    16. Xiang Li & Tianyu Zhang & Liang Wang & Hongguang Ma & Xiande Zhao, 2022. "A minimax regret model for the leader–follower facility location problem," Annals of Operations Research, Springer, vol. 309(2), pages 861-882, February.
    17. Küçükaydin, Hande & Aras, Necati & Kuban AltInel, I., 2011. "Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution," European Journal of Operational Research, Elsevier, vol. 208(3), pages 206-220, February.
    18. Rafael Suárez-Vega & Dolores Santos-Peñate & Pablo Dorta-González, 2014. "Location and quality selection for new facilities on a network market," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 52(2), pages 537-560, March.
    19. Francisco Silva & Daniel Serra, 2007. "Incorporating Waiting Time in Competitive Location Models," Networks and Spatial Economics, Springer, vol. 7(1), pages 63-76, March.
    20. Eiselt, H.A. & Marianov, Vladimir, 2020. "Maximizing political vote in multiple districts," Socio-Economic Planning Sciences, Elsevier, vol. 72(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:20:y:2012:i:3:p:639-660. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.