IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v7y1973i1p18-33.html
   My bibliography  Save this article

Optimal Locations on a Network

Author

Listed:
  • Richard E. Wendell

    (The Ohio State University, Columbus, Ohio)

  • Arthur P. Hurter

    (Northwestern University, Evanston, Illinois)

Abstract

The paper considers the location of centers (e.g., plants, warehouses) on a network. Necessary conditions and sufficient conditions for optimal solutions to occur at nodes in the network are determined. The conditions include consideration of capacity constraints and the possibility that not all shipments are made via the “shortest route.” The cost functions may differ from arc to arc. A proof is given for the sufficiency of node locations in situations of multistage processing when transport costs are concave over each arc. Three sets of conditions under which it is necessary for an optimal solution to occur at a node are investigated. One set of conditions involves a production function characterization of the centers being located.

Suggested Citation

  • Richard E. Wendell & Arthur P. Hurter, 1973. "Optimal Locations on a Network," Transportation Science, INFORMS, vol. 7(1), pages 18-33, February.
    • Handle: RePEc:inm:ortrsc:v:7:y:1973:i:1:p:18-33
    DOI: 10.1287/trsc.7.1.18
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.7.1.18
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.7.1.18?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. Ortiz-Astorquiza, Camilo & Contreras, Ivan & Laporte, Gilbert, 2018. "Multi-level facility location problems," European Journal of Operational Research, Elsevier, vol. 267(3), pages 791-805.
    2. Frank Plastria, 2009. "Asymmetric distances, semidirected networks and majority in Fermat–Weber problems," Annals of Operations Research, Springer, vol. 167(1), pages 121-155, 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:inm:ortrsc:v:7:y:1973:i:1:p:18-33. 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.