Hedging against service disruptions: An expected median location problem with site-dependent failure probabilities

Journal of Geographical Systems

Volumn 15, Issue 4, 2013, Pages 491-512

  Lei, Ting L ^a   Tong, Daoqin ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF ARIZONA   (United States)

Author keywords

Closest assignment; Integer linear programming; Location analysis; p Median problem; System vulnerability

Indexed keywords

EID: 84885650212     PISSN: 14355930     EISSN: 14355949     Source Type: Journal    
DOI: 10.1007/s10109-012-0175-y     Document Type: Article

References (39)

1. Bennett VL, Eaton DJ, Church RL (1982) Selecting sites for rural health workers. Soc Sci Med 16(1): 63-72.
2. Berman O, Krass D, Menezes MBC (2007) Facility reliability issues in network p-median problems: strategic centralization and co-location effects. Oper Res 55(2): 332-350.
3. Church RL, ReVelle C (1974) The maximal covering location problem. Pap Reg Sci Assoc 32(1): 101-118.
4. Church RL, ReVelle CS (1976) Theoretical and computational links between the p-median, location set-covering, and the maximal covering location problem. Geogr Anal 8(4): 407-415.
5. Church RL, Weaver JR (1986) Theoretical links between median and coverage location problems. Ann Oper Res 6(1): 1-19.
6. Church RL, Stoms DM, Davis FW (1996) Reserve selection as a maximal covering location problem. Biol Conserv 76(2): 105-112.
7. Church RL, Scaparra MP, Middleton RS (2004) Identifying critical infrastructure: the median and covering facility interdiction problems. Ann Assoc Am Geogr 94(3): 491-502.
8. Corley HW, Chang H (1974) Finding the n most vital nodes in a flow network. Manag Sci 21(3): 362-364.
9. Cui T, Ouyang Y, Shen ZJM (2010) Reliable facility location design under the risk of disruptions. Oper Res 58(4-Part-1): 998-1011.
10. Current JR, O'Kelly ME (1992) Locating emergency warning sirens. Decis Sci 23(1): 221-234.
11. Daskin MS (1983) A maximum expected covering location model: formulation, properties and heuristic solution. Transp Sci 17(1): 48-70.
12. Grubesic TH, Matisziw TC, Murray AT, Snediker D (2008) Comparative approaches for assessing network vulnerability. Int Reg Sci Rev 31(1): 88-112.
13. Hardy GH, Littlewood JE, Pólya G (1952) Inequalities, 2nd edn. Cambridge University Press, Cambridge.
14. Hogan K, ReVelle C (1986) Concepts and applications of backup coverage. Manag Sci 32(11): 1434-1444.
15. Israeli E, Wood RK (2002) Shortest-path network interdiction. Networks 40(2): 97-111.
16. Kim H (2011) p-hub protection models for survivable hub network design. J Geogr Syst. doi: 10. 1007/s10109-011-0157-5.
17. Kolli S, Evans GW (1999) A multiple objective integer programming approach for planning franchise expansion. Comput Ind Eng 37(3): 543-561.
18. Lei TL (2010) Location modeling utilizing closest and generalized closest transport/interaction assignment constructs. PhD. Dissertation, University of California, Santa Barbara, Santa Barbara.
19. Lei TL, Church RL (2011a) Constructs for multilevel closest assignment in location modeling. Int Reg Sci Rev 34(3): 339-367.
20. Lei TL, Church RL (2011b) Locating short-term empty-container storage facilities to support port operations: a user optimal approach. Transp Res Part E: Logist Transp Rev 47(5): 738-754.
21. Lei TL, Church RL (2012) Vector assignment ordered median problem: a unified median problem. Int Reg Sci Rev. doi: 10. 1177/0160017612450710.
22. Matisziw TC, Murray AT (2009) Area coverage maximization in service facility siting. J Geogr Syst 11(2): 175-189.
23. McMasters AW, Mustin TM (1970) Optimal interdiction of a supply network. Naval Res Logist Q 17(3): 261-268.
24. Murray AT, Grubesic TH (2007) Overview of reliability and vulnerability in critical infrastructure. In: Murray AT, Grubesic TH (eds) Critical infrastructure: reliability and vulnerability. Springer, Berlin, pp 1-8.
25. Murray AT, Matisziw TC, Grubesic TH (2007) Critical network infrastructure analysis: interdiction and system flow. J Geogr Syst 9(2): 103-117.
26. Narasimhan S, Pirkul H, Schilling DA (1992) Capacitated emergency facility siting with multiple levels of backup. Ann Oper Res 40(1): 323-337.
27. Nickel S, Puerto J (1999) A unified approach to network location problems. Networks 34(4): 283-290.
28. Pirkul H, Schilling D (1989) The capacitated maximal covering location problem with backup service. Ann Oper Res 18(1): 141-154.
29. ReVelle CS, Swain RW (1970) Central facilities location. Geogr Anal 2(1): 30-42.
30. Scaparra MP, Church RL (2008) A bilevel mixed-integer program for critical infrastructure protection planning. Comput Oper Res 35(6): 1905-1923.
31. Sherali HD, Alameddine A (1992) A new reformulation-linearization technique for bilinear programming problems. J Global Optim 2(4): 379-410.
32. Shillington L, Tong D (2011) Maximizing wireless mesh network coverage. Int Reg Sci Rev 34(4): 419-437.
33. Snyder LV, Daskin MS (2005) Reliability models for facility location: the expected failure cost case. Transp Sci 39(3): 400-416.
34. Swamy C, Shmoys DB (2008) Fault-tolerant facility location. ACM Trans Algorithms (TALG) 4(4): 51: 51-51: 27.
35. Tong D, Murray AT (2009) Maximizing coverage of spatial demand for service. Pap Reg Sci 88(1): 85-97.
36. Vince A (1990) A rearrangement inequality and the permutahedron. Am Math Mon 97(4): 319-323.
37. Weaver JR, Church RL (1985) A median location model with non-closest facility service. Transp Sci 19(1): 58-74.
38. Wollmer R (1964) Removing arcs from a network. Oper Res 12(6): 934-940.
39. Wood RK (1993) Deterministic network interdiction. Math Comput Model 17(2): 1-18.