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

Raheleh Khanduzi (), İhsan Sadati () and Vahid Akbari ()
Additional contact information
Raheleh Khanduzi: Gonbad Kavous University
İhsan Sadati: Sabanci University
Vahid Akbari: Nottingham University Business School, University of Nottingham

Operational Research, 2024, vol. 24, issue 4, No 9, 40 pages

Abstract: 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.

Keywords: Bilevel programming; Healthcare facility; Hierarchical network; Covering model; Protection; Interdiction; Metaheuristic algorithm (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12351-024-00870-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:operea:v:24:y:2024:i:4:d:10.1007_s12351-024-00870-5

Ordering information: This journal article can be ordered from
https://www.springer ... search/journal/12351

DOI: 10.1007/s12351-024-00870-5

Access Statistics for this article

Operational Research is currently edited by Nikolaos F. Matsatsinis, John Psarras and Constantin Zopounidis

More articles in Operational Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().