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

The Maximum Availability Location Problem

Author

Listed:
  • Charles ReVelle

    (The Johns Hopkins University, Baltimore, Maryland)

  • Kathleen Hogan

    (ICF, Fairfax, Virginia)

Abstract

A probabilistic version of the maximal covering location problem is introduced here. The maximum available location problem (MALP) positions p servers in such a way as to maximize the population which will find a server available within a time standard with (alpha) reliability. The maximum availability problem builds on the probabilistic location set covering problem in concept and on backup covering and expected covering models in technical detail. MALP bears the same relation to the probabilistic location set covering problem as the deterministic maximal covering problem bears to the deterministic location set covering problem. The maximum availability problem is structured here as a zero--one linear programming problem and solved on a medium-sized transportation network representing Baltimore City.

Suggested Citation

  • Charles ReVelle & Kathleen Hogan, 1989. "The Maximum Availability Location Problem," Transportation Science, INFORMS, vol. 23(3), pages 192-200, August.
    • Handle: RePEc:inm:ortrsc:v:23:y:1989:i:3:p:192-200
    DOI: 10.1287/trsc.23.3.192
    as

    Download full text from publisher

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

    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:23:y:1989:i:3:p:192-200. 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.