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

Note: Facility location with closest rectangular distances

Author

Listed:
  • J. Brimberg
  • G.O. Wesolowsky

Abstract

This paper considers the problem of locating one or more new facilities on a continuous plane, where the destinations or customers, and even the facilities, may be represented by areas and not points. The objective is to locate the facilities in order to minimize a sum of transportation costs. What is new in this study is that the relevant distances are the distances from the closest point in the facility to the closest point in the demand areas. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 77–84, 2000

Suggested Citation

  • 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.
    • Handle: RePEc:wly:navres:v:47:y:2000:i:1:p:77-84
    DOI: 10.1002/(SICI)1520-6750(200002)47:13.0.CO;2-#
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1520-6750(200002)47:13.0.CO;2-#
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1520-6750(200002)47:13.0.CO;2-#?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. 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. 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.
    2. 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.
    3. Stefan Nickel & Justo Puerto & Antonio M. Rodriguez-Chia, 2003. "An Approach to Location Models Involving Sets as Existing Facilities," Mathematics of Operations Research, INFORMS, vol. 28(4), pages 693-715, November.

    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. 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.
    2. 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.
    3. 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.
    4. G Babich, 1978. "An Efficient Algorithm for Solving the Rectilinear Location-Allocation Problem," Environment and Planning A, , vol. 10(12), pages 1387-1395, December.
    5. 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.
    6. Drezner, Zvi & Eiselt, H.A., 2024. "Competitive location models: A review," European Journal of Operational Research, Elsevier, vol. 316(1), pages 5-18.
    7. 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.
    8. 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.
    9. 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.

    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:47:y:2000:i:1:p:77-84. 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.