An Efficient Approach for Solving Reliable Facility Location Models

被引：48

作者：

Aboolian, Robert ^{[1
]}

Cui, Tingting ^{[2
]}

Shen, Zuo-Jun Max ^{[2
]}

机构：

[1] Calif State Univ San Marcos, Coll Business Adm, San Marcos, CA 92096 USA

[2] Univ Calif Berkeley, Dept Ind Engn & Operat Res, Berkeley, CA 94720 USA

来源：

INFORMS JOURNAL ON COMPUTING | 2013年 / 25卷 / 04期

基金：

美国国家科学基金会;

关键词：

facility location; reliability; mixed integer program; cutting planes; heuristics; supply chain disruption; ALGORITHM; FORMULATION; ALLOCATION; MULTIPLE; NETWORK; DESIGN;

D O I：

10.1287/ijoc.1120.0534

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We consider reliable facility location models in which facilities are subject to unexpected failures, and customers may be reassigned to facilities other than their regular facilities. The objective is to minimize the total expected costs in normal and failure scenarios. We allow facilities to have different failure rates and do not limit the number of facilities that might be assigned to a customer. Lower bounds for reliable uncapacitated fixed-charge location problem (RUFLP) are derived and used to introduce a class of efficient algorithms for solving the RUFLP problem.

引用

页码：720 / 729

页数：10

共 26 条

[21]

Sahin G, 2007, COMPUT OPER RES, V34, P2310, DOI [10.1016/j.cor.2005.09.005, 10.1016/j.cor.2006.09.005]

[22] The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms [J].

Shen, Zuo-Jun Max ;

Zhan, Roger Lezhou ;

Zhang, Jiawei .

INFORMS JOURNAL ON COMPUTING, 2011, 23 (03) :470-482

[23] Stochastic p-robust location problems [J].

Snyder, Lawrence V. ;

Daskin, Mark S. .

IIE TRANSACTIONS, 2006, 38 (11) :971-985

[24] Reliability models for facility location: The expected failure cost case [J].

Snyder, LV ;

Daskin, MS .

TRANSPORTATION SCIENCE, 2005, 39 (03) :400-416

[25]

Swamy C, 2003, P 14 ACM SIAM S DISC

[26] Approximation algorithms for the Fault-Tolerant Facility Placement problem [J].

Yan, Li ;

Chrobak, Marek .

INFORMATION PROCESSING LETTERS, 2011, 111 (11) :545-549

← 1 2 3 →