IDEAS home Printed from https://ideas.repec.org/a/sae/envira/v10y1978i12p1387-1395.html
   My bibliography  Save this article

An Efficient Algorithm for Solving the Rectilinear Location-Allocation Problem

Author

Listed:
  • G Babich

    (Department of Economic Statistics, University of Sydney, Sydney, NSW, Australia 2006)

Abstract

The rectilinear location-allocation problem may be solved analytically using familiar programming methods. However, the computational demands imposed by these techniques are often prohibitive. Cooper's Elimination—Alternate-Correction-Heuristic is modified to handle rectilinear distances. The algorithm seems to perform satisfactorily and is applied to the problem of locating fire-fighting appliances.

Suggested Citation

  • G Babich, 1978. "An Efficient Algorithm for Solving the Rectilinear Location-Allocation Problem," Environment and Planning A, , vol. 10(12), pages 1387-1395, December.
    • Handle: RePEc:sae:envira:v:10:y:1978:i:12:p:1387-1395
    DOI: 10.1068/a101387
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1068/a101387
    Download Restriction: no
    File URL: https://libkey.io/10.1068/a101387?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. George O. Wesolowsky, 1972. "Rectangular Distance Location under the Minimax Optimality Criterion," Transportation Science, INFORMS, vol. 6(2), pages 103-113, May.
    2. 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.
    3. G. O. Wesolowsky & R. F. Love, 1971. "Technical Note—The Optimal Location of New Facilities Using Rectangular Distances," Operations Research, INFORMS, vol. 19(1), pages 124-130, February.
    4. G. O. Wesolowsky & R. F. Love, 1972. "A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem," Management Science, INFORMS, vol. 18(11), pages 656-663, July.
    Full references (including those not matched with items on IDEAS)

    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. Sándor P. Fekete & Joseph S. B. Mitchell & Karin Beurer, 2005. "On the Continuous Fermat-Weber Problem," Operations Research, INFORMS, vol. 53(1), pages 61-76, February.
    2. 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.
    3. 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.
    4. 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.
    5. Noor-E-Alam, Md. & Mah, Andrew & Doucette, John, 2012. "Integer linear programming models for grid-based light post location problem," European Journal of Operational Research, Elsevier, vol. 222(1), pages 17-30.
    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. Nikolai Krivulin, 2017. "Using tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance," Computational Management Science, Springer, vol. 14(4), pages 493-518, October.
    8. 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.
    9. Venkateshan, Prahalad & Ballou, Ronald H. & Mathur, Kamlesh & Maruthasalam, Arulanantha P.P., 2017. "A Two-echelon joint continuous-discrete location model," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1028-1039.
    10. He, Yuxin & Zhao, Yang & Luo, Qin & Tsui, Kwok-Leung, 2022. "Forecasting nationwide passenger flows at city-level via a spatiotemporal deep learning approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 589(C).
    11. Diaz-Banez, J. M. & Mesa, J. A. & Schobel, A., 2004. "Continuous location of dimensional structures," European Journal of Operational Research, Elsevier, vol. 152(1), pages 22-44, January.
    12. 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.
    13. Enrique R. Venta & Francis J. Nourie, 1989. "Facility location on a grid with a diagonal line," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(5), pages 709-717, October.
    14. Drezner, Zvi & Eiselt, H.A., 2024. "Competitive location models: A review," European Journal of Operational Research, Elsevier, vol. 316(1), pages 5-18.
    15. Halit Üster & Robert F. Love, 2002. "Duality in constrained multi‐facility location models," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(4), pages 410-421, June.
    16. 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.
    17. 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.
    18. 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.
    19. Carrizosa, E. & Munoz-Marquez, M. & Puerto, J., 1998. "The Weber problem with regional demand," European Journal of Operational Research, Elsevier, vol. 104(2), pages 358-365, January.
    20. Murray, Alan T. & Church, Richard L. & Feng, Xin, 2020. "Single facility siting involving allocation decisions," European Journal of Operational Research, Elsevier, vol. 284(3), pages 834-846.

    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:sae:envira:v:10:y:1978:i:12:p:1387-1395. 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: SAGE Publications (email available below). General contact details of provider: .

    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.