IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v24y2024i4d10.1007_s12351-024-00870-5.html
   My bibliography  Save this article

A bilevel hierarchical covering model to protect a healthcare network against failures

Author

Listed:
  • Raheleh Khanduzi

    (Gonbad Kavous University)

  • İhsan Sadati

    (Sabanci University
    Sabanci University)

  • Vahid Akbari

    (Nottingham University Business School, University of Nottingham)

Abstract

This paper develops a bilevel problem to address the interdiction and fortification of the healthcare network in Golestan province, Iran. We explore a bilevel hierarchical covering interdiction/fortification problem (BHCIFP) to analyze the dynamics between interdiction and fortification operations, referral systems for healthcare services, capacitated health facilities, and budgetary constraints for both defense and offense. The defender (leader) aims to minimize the establishment cost of protective equipment and subsequent healthcare costs post-interdiction while maximizing patient coverage. Conversely, the attacker (follower) aims to disrupt the healthcare network by interdicting facilities, thereby increasing the total travel distance for patients. To solve this NP-hard problem, we employ a hybrid approach that integrates the tabu search algorithm (TS) for the leader’s problem with an exact method for the follower’s problem. A case study of Golestan’s healthcare network is presented to validate the model and hybrid approach. The model effectively minimizes travel distances by strategically locating defense bases, considering both the leader’s and attacker’s decisions. Comparative evaluations of the proposed hybrid TS and two other metaheuristic approaches are conducted on different case study instances and random instances. Numerical results demonstrate that the novel bilevel TS approach provides superior quality solutions in a reasonable time, establishing it as a competitive method for the proposed model.

Suggested Citation

  • Raheleh Khanduzi & İhsan Sadati & Vahid Akbari, 2024. "A bilevel hierarchical covering model to protect a healthcare network against failures," Operational Research, Springer, vol. 24(4), pages 1-40, December.
    • Handle: RePEc:spr:operea:v:24:y:2024:i:4:d:10.1007_s12351-024-00870-5
    DOI: 10.1007/s12351-024-00870-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-024-00870-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-024-00870-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Mestre, Ana Maria & Oliveira, Mónica Duarte & Barbosa-Póvoa, Ana Paula, 2015. "Location–allocation approaches for hospital network planning under uncertainty," European Journal of Operational Research, Elsevier, vol. 240(3), pages 791-806.
    2. Martha-Selene Casas-Ramírez & José-Fernando Camacho-Vallejo & Juan A. Díaz & Dolores E. Luna, 2020. "A bi-level maximal covering location problem," Operational Research, Springer, vol. 20(2), pages 827-855, June.
    3. Harper, P. R. & Shahani, A. K. & Gallagher, J. E. & Bowie, C., 2005. "Planning health services with explicit geographical considerations: a stochastic location-allocation approach," Omega, Elsevier, vol. 33(2), pages 141-152, April.
    4. Galvao, Roberto D. & Acosta Espejo, Luis Gonzalo & Boffey, Brian, 2002. "A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro," European Journal of Operational Research, Elsevier, vol. 138(3), pages 495-517, May.
    5. Marcos Costa Roboredo & Luiz Aizemberg & Artur Alves Pessoa, 2019. "An exact approach for the r-interdiction covering problem with fortification," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(1), pages 111-131, March.
    6. 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.
    7. Omar Ben-Ayed & Charles E. Blair, 1990. "Computational Difficulties of Bilevel Linear Programming," Operations Research, INFORMS, vol. 38(3), pages 556-560, June.
    8. Burkey, M.L. & Bhadury, J. & Eiselt, H.A., 2012. "A location-based comparison of health care services in four U.S. states with efficiency and equity," Socio-Economic Planning Sciences, Elsevier, vol. 46(2), pages 157-163.
    9. F J Vasko & P J Knolle & D S Spiegel, 2005. "An empirical study of hybrid genetic algorithms for the set covering problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(10), pages 1213-1223, October.
    10. Fred Glover, 1990. "Tabu Search—Part II," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 4-32, February.
    11. X-Y Li & P Tian & S C H Leung, 2009. "An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(7), pages 1012-1025, July.
    12. Benoît Colson & Patrice Marcotte & Gilles Savard, 2007. "An overview of bilevel optimization," Annals of Operations Research, Springer, vol. 153(1), pages 235-256, September.
    13. Zarrinpoor, Naeme & Fallahnezhad, Mohammad Saber & Pishvaee, Mir Saman, 2018. "The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm," European Journal of Operational Research, Elsevier, vol. 265(3), pages 1013-1032.
    14. Hausken, Kjell, 2017. "Defense and attack for interdependent systems," European Journal of Operational Research, Elsevier, vol. 256(2), pages 582-591.
    15. Starita, Stefano & Scaparra, Maria Paola, 2016. "Optimizing dynamic investment decisions for railway systems protection," European Journal of Operational Research, Elsevier, vol. 248(2), pages 543-557.
    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. Zarrinpoor, Naeme & Fallahnezhad, Mohammad Saber & Pishvaee, Mir Saman, 2018. "The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm," European Journal of Operational Research, Elsevier, vol. 265(3), pages 1013-1032.
    2. Mousazadeh, M. & Torabi, S. Ali & Pishvaee, M.S. & Abolhassani, F., 2018. "Accessible, stable, and equitable health service network redesign: A robust mixed possibilistic-flexible approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 111(C), pages 113-129.
    3. Karakaya, Şakir & Meral, Sedef, 2022. "A biobjective hierarchical location-allocation approach for the regionalization of maternal-neonatal care," Socio-Economic Planning Sciences, Elsevier, vol. 79(C).
    4. C-H Lan & C-C Chen, 2007. "Optimal purchase of two-itemized drugs for a disease," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 309-316, March.
    5. Emina Krcmar & Snezana Mitrovic-Minic & G. Cornelis van Kooten & Ilan Vertinsky, 2005. "Forest Management Zone Design with a Tabu Search Algorithm," Working Papers 2005-12, University of Victoria, Department of Economics, Resource Economics and Policy Analysis Research Group.
    6. G Lulli & U Pietropaoli & N Ricciardi, 2011. "Service network design for freight railway transportation: the Italian case," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(12), pages 2107-2119, December.
    7. Puchit Sariddichainunta & Masahiro Inuiguchi, 2017. "Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function," Annals of Operations Research, Springer, vol. 256(2), pages 285-304, September.
    8. Hsin-Hung Cho & Wei-Che Chien & Fan-Hsun Tseng & Han-Chieh Chao, 2023. "Artificial-Intelligence-Based Charger Deployment in Wireless Rechargeable Sensor Networks," Future Internet, MDPI, vol. 15(3), pages 1-18, March.
    9. Haochen Zhang & Shaowei Cai & Chuan Luo & Minghao Yin, 2017. "An efficient local search algorithm for the winner determination problem," Journal of Heuristics, Springer, vol. 23(5), pages 367-396, October.
    10. Gabriel Lopez Zenarosa & Oleg A. Prokopyev & Eduardo L. Pasiliao, 2021. "On exact solution approaches for bilevel quadratic 0–1 knapsack problem," Annals of Operations Research, Springer, vol. 298(1), pages 555-572, March.
    11. Wu, Xinyun & Lü, Zhipeng & Glover, Fred, 2020. "A matheuristic for a telecommunication network design problem with traffic grooming," Omega, Elsevier, vol. 90(C).
    12. Drexl, Andreas & Salewski, Frank, 1996. "Distribution Requirements and Compactness Constraints in School Timetabling. Part II: Methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 384, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Cheung, Kam-Fung & Bell, Michael G.H., 2021. "Improving connectivity of compromised digital networks via algebraic connectivity maximisation," European Journal of Operational Research, Elsevier, vol. 294(1), pages 353-364.
    14. Anuj Mehrotra & Joseph Shantz & Michael A. Trick, 2005. "Determining newspaper marketing zones using contiguous clustering," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 82-92, February.
    15. Dimitris Fouskakis & David Draper, 2002. "Stochastic Optimization: a Review," International Statistical Review, International Statistical Institute, vol. 70(3), pages 315-349, December.
    16. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
    17. Wenxuan Shan & Qianqian Yan & Chao Chen & Mengjie Zhang & Baozhen Yao & Xuemei Fu, 2019. "Optimization of competitive facility location for chain stores," Annals of Operations Research, Springer, vol. 273(1), pages 187-205, February.
    18. Sadan Kulturel-Konak & Bryan A. Norman & David W. Coit & Alice E. Smith, 2004. "Exploiting Tabu Search Memory in Constrained Problems," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 241-254, August.
    19. Ouzineb, Mohamed & Nourelfath, Mustapha & Gendreau, Michel, 2008. "Tabu search for the redundancy allocation problem of homogenous series–parallel multi-state systems," Reliability Engineering and System Safety, Elsevier, vol. 93(8), pages 1257-1272.
    20. Talip Kellegöz, 2017. "Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method," Annals of Operations Research, Springer, vol. 253(1), pages 377-404, 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:spr:operea:v:24:y:2024:i:4:d:10.1007_s12351-024-00870-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.