IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v44y1997i1p81-95.html
   My bibliography  Save this article

Replacing continuous demand with discrete demand in a competitive location model

Author

Listed:
  • Tammy Drezner
  • Zvi Drezner

Abstract

Location models commonly represent demand as discrete points rather than as continuously spread over an area. This modeling technique introduces inaccuracies to the objective function and consequently to the optimal location solution. In this article this inaccuracy is investigated by the study of a particular competitive facility location problem. First, the location problem is formulated over a continuous demand area. The optimal location for a new facility that optimizes the objective function is obtained. This optimal location solution is then compared with the optimal location obtained for a discrete set of demand points. Second, a simple approximation approach to the continuous demand formulation is proposed. The location problem can be solved by using the discrete demand algorithm while significantly reducing the inaccuracies. This way the simplicity of the discrete approach is combined with the approximated accuracy of the continuous‐demand location solution. Extensive analysis and computations of the test problem are reported. It is recommended that this approximation approach be considered for implementation in other location models. © 1997 John Wiley & Sons, Inc.

Suggested Citation

  • Tammy Drezner & Zvi Drezner, 1997. "Replacing continuous demand with discrete demand in a competitive location model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(1), pages 81-95, February.
    • Handle: RePEc:wly:navres:v:44:y:1997:i:1:p:81-95
    DOI: 10.1002/(SICI)1520-6750(199702)44:13.0.CO;2-I
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1520-6750(199702)44:13.0.CO;2-I
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1520-6750(199702)44:13.0.CO;2-I?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
    ---><---

    References listed on IDEAS

    as
    1. Z. Drezner & G. O. Weslowsky, 1980. "Optimal location of a facility relative to area demands," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 27(2), pages 199-206, June.
    2. Zvi Drezner, 1986. "Location of regional facilities," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 33(3), pages 523-529, August.
    3. G. O. Wesolowsky & R. F. Love, 1971. "Location of facilities with rectangular distances among point and area destinations," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 18(1), pages 83-90, March.
    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. Drezner, Zvi & Eiselt, H.A., 2024. "Competitive location models: A review," European Journal of Operational Research, Elsevier, vol. 316(1), pages 5-18.
    2. Zvi Drezner, 2009. "On the convergence of the generalized Weiszfeld algorithm," Annals of Operations Research, Springer, vol. 167(1), pages 327-336, March.
    3. F. Javier Otamendi & David García-Heredia, 2015. "Isochrones as Indicators of the Influence of Traffic in Public Health: A Visual Simulation Application in Ávila, Spain," IJERPH, MDPI, vol. 12(10), pages 1-21, October.
    4. Ran Wei, 2016. "Coverage Location Models," International Regional Science Review, , vol. 39(1), pages 48-76, January.
    5. Matisziw, Timothy C. & Murray, Alan T., 2009. "Siting a facility in continuous space to maximize coverage of a region," Socio-Economic Planning Sciences, Elsevier, vol. 43(2), pages 131-139, June.
    6. Jing Yao & Alan T. Murray, 2014. "Serving regional demand in facility location," Papers in Regional Science, Wiley Blackwell, vol. 93(3), pages 643-662, August.
    7. H Küçükaydın & N Aras & İ K Altınel, 2011. "A discrete competitive facility location model with variable attractiveness," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(9), pages 1726-1741, September.
    8. Ran Wei & Alan Murray, 2015. "Spatial uncertainty in harvest scheduling," Annals of Operations Research, Springer, vol. 232(1), pages 275-289, September.
    9. H. A. Eiselt & Vladimir Marianov, 2020. "Stability of utility functions and apportionment rules in location models," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(3), pages 772-792, October.
    10. Hai Yang & S. C. Wong, 2000. "A Continuous Equilibrium Model for Estimating Market Areas of Competitive Facilities with Elastic Demand and Market Externality," Transportation Science, INFORMS, vol. 34(2), pages 216-227, May.
    11. 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.

    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. Tammy Drezner & Zvi Drezner & Pawel Kalczynski, 2019. "A directional approach to gradual cover," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(1), pages 70-93, April.
    2. Drezner, Zvi & Eiselt, H.A., 2024. "Competitive location models: A review," European Journal of Operational Research, Elsevier, vol. 316(1), pages 5-18.
    3. James F. Campbell, 1992. "Location‐allocation for distribution to a uniform demand with transshipments," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(5), pages 635-649, August.
    4. Thomas Byrne & Sándor P. Fekete & Jörg Kalcsics & Linda Kleist, 2023. "Competitive location problems: balanced facility location and the One-Round Manhattan Voronoi Game," Annals of Operations Research, Springer, vol. 321(1), pages 79-101, February.
    5. Masashi Miyagawa, 2020. "Optimal number and length of point-like and line-like facilities of grid and random patterns," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(1), pages 213-230, April.
    6. J. Brimberg & G.O. Wesolowsky, 2000. "Note: Facility location with closest rectangular distances," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(1), pages 77-84, February.
    7. G Babich, 1978. "An Efficient Algorithm for Solving the Rectilinear Location-Allocation Problem," Environment and Planning A, , vol. 10(12), pages 1387-1395, December.
    8. Jannett Highfill & Michael Mcasey & Libin Mou, 1998. "Locating a recycling center: The general density case," International Advances in Economic Research, Springer;International Atlantic Economic Society, vol. 4(4), pages 428-440, November.
    9. S. Nobakhtian & A. Raeisi Dehkordi, 2018. "An algorithm for generalized constrained multi-source Weber problem with demand substations," 4OR, Springer, vol. 16(4), pages 343-377, December.
    10. Nazlı Dolu & Umur Hastürk & Mustafa Kemal Tural, 2020. "Solution methods for a min–max facility location problem with regional customers considering closest Euclidean distances," Computational Optimization and Applications, Springer, vol. 75(2), pages 537-560, March.

    More about this item

    Statistics

    Access and download statistics

    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:wly:navres:v:44:y:1997:i:1:p:81-95. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.