The Maximum Availability Location Problem

Charles ReVelle and Kathleen Hogan
Additional contact information
Charles ReVelle: The Johns Hopkins University, Baltimore, Maryland
Kathleen Hogan: ICF, Fairfax, Virginia

Transportation Science, 1989, vol. 23, issue 3, 192-200

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.

Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (81)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.23.3.192 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:23:y:1989:i:3:p:192-200

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().