Reliability models for facility location: The expected failure cost case

被引:522
作者
Snyder, LV [1 ]
Daskin, MS
机构
[1] Lehigh Univ, Dept Ind & Syst Engn, Bethlehem, PA 18015 USA
[2] Northwestern Univ, Dept Ind Engn & Management Sci, Evanston, IL 60208 USA
关键词
facility location; disruptions; Lagrangian relaxation; multiobjective optimization;
D O I
10.1287/trsc.1040.0107
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Classical facility location models like the P-median problem (PMP) and the uncapacitated fixed-charge location problem (UFLP) implicitly assume that, once constructed, the facilities chosen will always operate as planned. In reality, however, facilities "fail" from time to time due to poor weather, labor actions, changes of ownership, or other factors. Such failures may lead to excessive transportation costs as customers must be served from facilities much farther than their regularly assigned facilities. In this paper, we present models for choosing facility locations to minimize cost, while also taking into account the expected transportation cost after failures of facilities. The goal is to choose facility locations that are both inexpensive under traditional objective functions and also reliable. This reliability approach is new in the facility location literature. We formulate reliability models based on both the PMP and the UFLP and present an optimal Lagrangian relaxation algorithm to solve them. We discuss how to use these models to generate a trade-off curve between the day-to-day operating cost and the expected cost, taking failures into account, and we use these trade-off curves to demonstrate empirically that substantial improvements in reliability are often possible with minimal increases in operating cost.
引用
收藏
页码:400 / 416
页数:17
相关论文
共 36 条
[21]  
Larson R. C., 1974, Computers & Operations Research, V1, P67, DOI 10.1016/0305-0548(74)90076-8
[22]   APPROXIMATING PERFORMANCE OF URBAN EMERGENCY SERVICE SYSTEMS [J].
LARSON, RC .
OPERATIONS RESEARCH, 1975, 23 (05) :845-868
[23]  
Lynn B., 2002, HARPERS, V304, P33
[24]  
MARTHA J, 2002, VIEWPOINT, P44
[25]  
Menezes M., 2003, INFORMS ANN M ATL GA
[26]   MINIMUM-WEIGHT 2-CONNECTED SPANNING NETWORKS [J].
MONMA, CL ;
MUNSON, BS ;
PULLEYBLANK, WR .
MATHEMATICAL PROGRAMMING, 1990, 46 (02) :153-171
[27]   METHODS FOR DESIGNING COMMUNICATIONS NETWORKS WITH CERTAIN 2-CONNECTED SURVIVABILITY CONSTRAINTS [J].
MONMA, CL ;
SHALLCROSS, DF .
OPERATIONS RESEARCH, 1989, 37 (04) :531-541
[28]  
NAVAS D, 2003, SUPPLY CHAIN SYSTEMS, P12
[30]   THE MAXIMUM AVAILABILITY LOCATION PROBLEM [J].
REVELLE, C ;
HOGAN, K .
TRANSPORTATION SCIENCE, 1989, 23 (03) :192-200