Reliability Models for Facility Location: The Expected Failure Cost Case

Transportation Science - Tập 39 Số 3 - Trang 400-416 - 2005
Lawrence Snyder1, Mark S. Daskin2
1Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, Pennsylvania 18015#TAB#
2Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208

Tóm tắt

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.

Từ khóa


Tài liệu tham khảo

10.1287/opre.27.4.823

10.1287/opre.41.1.18

Berman O., 2001, Facility Location: Applications and Theory, 331

10.1287/opre.33.4.746

10.1137/0403027

Bundschuh M., 2003, Optimization Online e-print.

10.1007/BF01942293

Cohon J. L., 1978, Multiobjective Programming and Planning

Colbourn C. J., 1987, The Combinatorics of Network Reliability

10.1111/j.1540-5915.1982.tb00159.x

10.1287/trsc.17.1.48

10.1002/9781118032343

10.1068/b150015

10.1016/0020-0190(96)00024-5

10.1287/mnsc.27.1.1

10.1287/inte.15.2.10

10.1007/s10107-002-0299-9

10.1287/opre.43.6.1012

Krass D., 2003, EURO/INFORMS Joint Internat.

10.1016/0305-0548(74)90076-8

10.1287/opre.23.5.845

Lynn B., 2002, Harper’s, 304, 33

Martha J., 2002, Viewpoint, 44

Menezes M., 2003, INFORMS Annual Meeting

Menezes M., 2003, INFORMS Annual Meeting

10.1287/opre.37.4.531

10.1007/BF01585735

Navas D., 2003, Supply Chain Systems, 12

10.1080/07408178908966240

10.1287/trsc.23.3.192

10.1108/09574090110806262

Shier D. R., 1991, Network Reliability and Algebraic Structures, 10.1093/oso/9780198533863.001.0001

10.1002/047122460X

Simchi-Levi D., 2002, Supply Chain Management Rev., 6, 11

Snyder L. V. Supply chain robustness and reliability: Models and algorithms. (2003) . Ph.D. dissertation, Northwestern University, Department of Industrial Engineering & Management Sciences, Evanston, IL

Vidal C. J., 2000, J. Bus. Logist., 21, 95

10.1287/trsc.19.1.58