IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v28y1982i7p775-780.html
   My bibliography  Save this article

The Hierarchical Service Location Problem

Author

Listed:
  • George C. Moore

    (The Johns Hopkins University)

  • Charles ReVelle

    (The Johns Hopkins University)

Abstract

A location problem with a hierarchy of facilities and services is proposed and solved. The formulation defines a demand point to be covered for a given level of service if some member of the facility hierarchy eligible to provide that service is present within an appropriate distance. Furthermore, the absence of coverage at any one service level for a demand point is taken to imply lack of coverage in the grand measure of coverage. The problem's objective is the maximum coverage of population given specific limits on either the number of each type of facility or on the total investment that can be made in all facility types. Relaxed linear programming, supplemented by branch and bound where necessary, is used to solve the resulting integer programming problem. An application is described that uses distance and population data developed for a region of Honduras. Honduran nationals are currently being trained in the use of this and related location methodologies under a contract with the Agency for International Development. This effort is in support of work being undertaken by the Honduran National Planning Council to develop a nationwide data set of populated places in Honduras to which location methodologies will be applied.

Suggested Citation

  • George C. Moore & Charles ReVelle, 1982. "The Hierarchical Service Location Problem," Management Science, INFORMS, vol. 28(7), pages 775-780, July.
    • Handle: RePEc:inm:ormnsc:v:28:y:1982:i:7:p:775-780
    DOI: 10.1287/mnsc.28.7.775
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.28.7.775
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.28.7.775?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:ormnsc:v:28:y:1982:i:7:p:775-780. 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.