备份
概率逻辑
设置覆盖问题
数学优化
设施选址问题
可靠性(半导体)
掩盖问题
集合(抽象数据类型)
计算机科学
服务器
流量网络
线性规划
人口
运筹学
数学
计算机网络
数据库
量子力学
人口学
物理
程序设计语言
人工智能
社会学
功率(物理)
作者
Charles ReVelle,Kathleen B. Hogan
出处
期刊:Transportation Science
[Institute for Operations Research and the Management Sciences]
日期:1989-08-01
卷期号:23 (3): 192-200
被引量:495
标识
DOI:10.1287/trsc.23.3.192
摘要
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 α 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.
科研通智能强力驱动
Strongly Powered by AbleSci AI