IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v22y1975i3p441-453.html
   My bibliography  Save this article

A computation procedure for the exact solution of location‐allocation problems with rectangular distances

Author

Listed:
  • Robert F. Love
  • James G. Morris

Abstract

A method is presented to locate and allocate p new facilities in relation to n existing facilities. Each of the n existing facilities has a requirement flow which must be supplied by the new facilities. Rectangular distances are assumed to exist between all facilities. The algorithm proceeds in two stages. In the first stage a set of all possible optimal new facility locations is determined by a set reduction algorithm. The resultant problem is shown to be equivalent to finding the p‐median of a weighted connected graph. In the second stage the optimal locations and allocations are obtained by using a technique for solving the p‐median problem.

Suggested Citation

  • Robert F. Love & James G. Morris, 1975. "A computation procedure for the exact solution of location‐allocation problems with rectangular distances," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 22(3), pages 441-453, September.
    • Handle: RePEc:wly:navlog:v:22:y:1975:i:3:p:441-453
    DOI: 10.1002/nav.3800220304
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800220304
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800220304?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
    ---><---

    Citations

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


    Cited by:

    1. R. Chen & Y. Handler, 1993. "The conditional p‐center problem in the plane," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(1), pages 117-127, February.

    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:navlog:v:22:y:1975:i:3:p:441-453. 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.

    We have no bibliographic references for this item. You can help adding them by using 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)1931-9193 .

    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.