期刊
INFORMS JOURNAL ON COMPUTING
卷 23, 期 3, 页码 470-482出版社
INFORMS
DOI: 10.1287/ijoc.1100.0414
关键词
reliable facility location problem; uncertainty; heuristics; approximation algorithm
资金
- National Science Foundation [CMMI-0621433, CMMI-0727640]
We study a reliable facility location problem wherein some facilities are subject to failure from time to time. If a facility fails, customers originally assigned to it have to be reassigned to other (operational) facilities. We formulate this problem as a two-stage stochastic program and then as a nonlinear integer program. Several heuristics that can produce near-optimal solutions are proposed for this NP-hard problem. For the special case where the probability that a facility fails is a constant (independent of the facility), we provide an approximation algorithm with a worst-case bound of 4. The effectiveness of our heuristics is tested by extensive computational studies, which also lead to some managerial insights.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据