IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v209y2011i1p23-36.html
   My bibliography  Save this article

Designing robust coverage networks to hedge against worst-case facility losses

Author

Listed:
  • O'Hanley, Jesse R.
  • Church, Richard L.

Abstract

In order to design a coverage-type service network that is robust to the worst instances of long-term facility loss, we develop a facility location-interdiction model that maximizes a combination of initial coverage by p facilities and the minimum coverage level following the loss of the most critical r facilities. The problem is formulated both as a mixed-integer program and as a bilevel mixed-integer program. To solve the bilevel program optimally, a decomposition algorithm is presented, whereby the original bilevel program is decoupled into an upper level master problem and a lower level subproblem. After sequentially solving these problems, supervalid inequalities can be generated and appended to the upper level master in an attempt to force it away from clearly dominated solutions. Computational results show that when solved to optimality, the bilevel decomposition algorithm is up to several orders of magnitude faster than performing branch and bound on the mixed-integer program.

Suggested Citation

  • O'Hanley, Jesse R. & Church, Richard L., 2011. "Designing robust coverage networks to hedge against worst-case facility losses," European Journal of Operational Research, Elsevier, vol. 209(1), pages 23-36, February.
    • Handle: RePEc:eee:ejores:v:209:y:2011:i:1:p:23-36
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00590-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Mark S. Daskin, 1983. "A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution," Transportation Science, INFORMS, vol. 17(1), pages 48-70, February.
    2. Lukac, Zrinka & Soric, Kristina & Rosenzweig, Visnja Vojvodic, 2008. "Production planning problem with sequence dependent setups as a bilevel programming problem," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1504-1512, June.
    3. Cao, Dong & Chen, Mingyuan, 2006. "Capacitated plant selection in a decentralized manufacturing environment: A bilevel optimization approach," European Journal of Operational Research, Elsevier, vol. 169(1), pages 97-110, February.
    4. Scaparra, Maria P. & Church, Richard L., 2008. "An exact solution approach for the interdiction median problem with fortification," European Journal of Operational Research, Elsevier, vol. 189(1), pages 76-92, August.
    5. Robert G. Haight & Charles S. Revelle & Stephanie A. Snyder, 2000. "An Integer Optimization Approach to a Probabilistic Reserve Site Selection Problem," Operations Research, INFORMS, vol. 48(5), pages 697-708, October.
    6. Alan Washburn & Kevin Wood, 1995. "Two-Person Zero-Sum Games for Network Interdiction," Operations Research, INFORMS, vol. 43(2), pages 243-251, April.
    7. Wen, U. P. & Huang, A. D., 1996. "A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 563-571, February.
    8. Lawrence V. Snyder & Mark S. Daskin, 2005. "Reliability Models for Facility Location: The Expected Failure Cost Case," Transportation Science, INFORMS, vol. 39(3), pages 400-416, August.
    9. Kelly J. Cormican & David P. Morton & R. Kevin Wood, 1998. "Stochastic Network Interdiction," Operations Research, INFORMS, vol. 46(2), pages 184-197, April.
    10. Kathleen Hogan & Charles ReVelle, 1986. "Concepts and Applications of Backup Coverage," Management Science, INFORMS, vol. 32(11), pages 1434-1444, November.
    11. Richard Wollmer, 1964. "Removing Arcs from a Network," Operations Research, INFORMS, vol. 12(6), pages 934-940, December.
    12. Mozart Menezes & O. Berman & D. Krass, 2007. "Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-location Effects," Post-Print halshs-00170396, HAL.
    13. Jeffrey D. Camm & Susan K. Norman & Stephen Polasky & Andrew R. Solow, 2002. "Nature Reserve Site Selection to Maximize Expected Species Covered," Operations Research, INFORMS, vol. 50(6), pages 946-955, December.
    14. Uno, Takeshi & Katagiri, Hideki, 2008. "Single- and multi-objective defensive location problems on a network," European Journal of Operational Research, Elsevier, vol. 188(1), pages 76-84, July.
    15. Richard D. Wollmer, 1970. "Algorithms for Targeting Strikes in a Lines-of-Communication Network," Operations Research, INFORMS, vol. 18(3), pages 497-515, June.
    16. Charles ReVelle & Kathleen Hogan, 1989. "The Maximum Availability Location Problem," Transportation Science, INFORMS, vol. 23(3), pages 192-200, August.
    17. James T. Moore & Jonathan F. Bard, 1990. "The Mixed Integer Linear Bilevel Programming Problem," Operations Research, INFORMS, vol. 38(5), pages 911-921, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. O’Hanley, Jesse R. & Scaparra, M. Paola & García, Sergio, 2013. "Probability chains: A general linearization technique for modeling reliability in facility location and related problems," European Journal of Operational Research, Elsevier, vol. 230(1), pages 63-75.
    2. Parajuli, Anubhuti & Kuzgunkaya, Onur & Vidyarthi, Navneet, 2017. "Responsive contingency planning of capacitated supply networks under disruption risks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 102(C), pages 13-37.
    3. Trung Hieu Tran & Jesse R. O’Hanley & M. Paola Scaparra, 2017. "Reliable Hub Network Design: Formulation and Solution Techniques," Transportation Science, INFORMS, vol. 51(1), pages 358-375, February.
    4. Ting Lei & Daoqin Tong, 2013. "Hedging against service disruptions: an expected median location problem with site-dependent failure probabilities," Journal of Geographical Systems, Springer, vol. 15(4), pages 491-512, October.
    5. Stephanie A. Snyder & Robert G. Haight, 2016. "Application of the Maximal Covering Location Problem to Habitat Reserve Site Selection," International Regional Science Review, , vol. 39(1), pages 28-47, January.
    6. Chaya Losada & M. Scaparra & Richard Church & Mark Daskin, 2012. "The stochastic interdiction median problem with disruption intensity levels," Annals of Operations Research, Springer, vol. 201(1), pages 345-365, December.
    7. An, Shi & Cui, Na & Bai, Yun & Xie, Weijun & Chen, Mingliu & Ouyang, Yanfeng, 2015. "Reliable emergency service facility location under facility disruption, en-route congestion and in-facility queuing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 82(C), pages 199-216.
    8. Tingting Cui & Yanfeng Ouyang & Zuo-Jun Max Shen, 2010. "Reliable Facility Location Design Under the Risk of Disruptions," Operations Research, INFORMS, vol. 58(4-part-1), pages 998-1011, August.
    9. Masashi Miyagawa, 2012. "Joint distribution of distances to the first and the second nearest facilities," Journal of Geographical Systems, Springer, vol. 14(2), pages 209-222, April.
    10. Leonardo Lozano & J. Cole Smith, 2017. "A Backward Sampling Framework for Interdiction Problems with Fortification," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 123-139, February.
    11. Trung Hieu Tran & Thu Ba T. Nguyen, 2019. "Alternative-fuel station network design under impact of station failures," Annals of Operations Research, Springer, vol. 279(1), pages 151-186, August.
    12. Fadda, Edoardo & Manerba, Daniele & Tadei, Roberto, 2024. "How to locate services optimizing redundancy: A comparative analysis of K-Covering Facility Location models," Socio-Economic Planning Sciences, Elsevier, vol. 94(C).
    13. Cui, Tingting & Ouyang, Yanfeng & Shen, Zuo-Jun Max J, 2010. "Reliable Facility Location Design under the Risk of Disruptions," University of California Transportation Center, Working Papers qt5sh2c7pw, University of California Transportation Center.
    14. Marianov, Vladimir & Eiselt, H.A., 2024. "Fifty Years of Location Theory - A Selective Review," European Journal of Operational Research, Elsevier, vol. 318(3), pages 701-718.
    15. Jeffrey D. Camm & Susan K. Norman & Stephen Polasky & Andrew R. Solow, 2002. "Nature Reserve Site Selection to Maximize Expected Species Covered," Operations Research, INFORMS, vol. 50(6), pages 946-955, December.
    16. Davood Shishebori & Lawrence Snyder & Mohammad Jabalameli, 2014. "A Reliable Budget-Constrained FL/ND Problem with Unreliable Facilities," Networks and Spatial Economics, Springer, vol. 14(3), pages 549-580, December.
    17. P. Daniel Wright & Matthew J. Liberatore & Robert L. Nydick, 2006. "A Survey of Operations Research Models and Applications in Homeland Security," Interfaces, INFORMS, vol. 36(6), pages 514-529, December.
    18. Laan, Corine M. & van der Mijden, Tom & Barros, Ana Isabel & Boucherie, Richard J. & Monsuur, Herman, 2017. "An interdiction game on a queueing network with multiple intruders," European Journal of Operational Research, Elsevier, vol. 260(3), pages 1069-1080.
    19. Matteo Fischetti & Ivana Ljubić & Michele Monaci & Markus Sinnl, 2019. "Interdiction Games and Monotonicity, with Application to Knapsack Problems," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 390-410, April.
    20. Lukac, Zrinka & Soric, Kristina & Rosenzweig, Visnja Vojvodic, 2008. "Production planning problem with sequence dependent setups as a bilevel programming problem," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1504-1512, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:209:y:2011:i:1:p:23-36. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.