IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v33y1985i4p784-802.html
   My bibliography  Save this article

The Solution of Distance Constrained Mini-Sum Location Problems

Author

Listed:
  • C. D. T. Watson-Gandy

    (Imperial College, London, England)

Abstract

The problem considered in this paper requires determining the location of a given number of centers or facilities to minimize the sum of weighted distances to customers being served, subject to the constraint that no customer receives inadequate service. The method proposed is a partial enumerative procedure that employs both a graph-coloring algorithm (to generate feasible partitions) and an iterative location procedure with feasibility tests (to determine optimal locations). The procedure ensures the global optimum to this otherwise non-convex location-allocation problem. The procedure has been programmed and computational results are presented.

Suggested Citation

  • C. D. T. Watson-Gandy, 1985. "The Solution of Distance Constrained Mini-Sum Location Problems," Operations Research, INFORMS, vol. 33(4), pages 784-802, August.
    • Handle: RePEc:inm:oropre:v:33:y:1985:i:4:p:784-802
    DOI: 10.1287/opre.33.4.784
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.33.4.784
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.33.4.784?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
    ---><---

    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:inm:oropre:v:33:y:1985:i:4:p:784-802. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.