THE MAXIMUM AVAILABILITY LOCATION PROBLEM

A probabilistic version of the maximal covering location problem is introduced in this paper. The maximum available location problem (MALP) positions a limited number of servers in such a way as to maximize the population which will find a server available within a time standard with a stated 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 as a zero-one linear programming problem and solved on a medium-sized transportation network representing Baltimore City.

• Availability:
  • Find a library where document is available. Order URL: https://www.library.northwestern.edu/find-borrow-request/requests-interlibrary-loan/lending-institutions.html
• Authors:
  • REVELLE, C
  • HOGAN, K
• Publication Date: 1989-8

Media Info

• Features: Figures; References;
• Pagination: p. 192-200
• Serial:
  • Transportation Science
  • Volume: 23
  • Issue Number: 3
  • Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
  • ISSN: 0041-1655
  • Serial URL: http://transci.journal.informs.org/

Subject/Index Terms

• TRT Terms: Facilities; Linear programming; Location; Mathematical models; Probability
• Uncontrolled Terms: Probabilistic analysis
• Old TRIS Terms: Maximum availability location problem
• Subject Areas: Data and Information Technology; Highways; Planning and Forecasting; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 00488568
• Record Type: Publication
• Files: TRIS, ATRI
• Created Date: Oct 31 1989 12:00AM