A partial coverage hierarchical location allocation model for health services

Date

2023-01-01

Author

Karasakal, Orhan
Karasakal, Esra
Toreyen, Ozgun

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

253
views

0
downloads

We consider a hierarchical maximal covering location problem (HMCLP) to locate health centres and hospitals so that the maximum demand is covered by two levels of services in a successively inclusive hierarchy. We extend the HMCLP by introducing the partial coverage and a new definition of the referral. The proposed model may enable an informed decision on the healthcare system when dynamic adaptation is required, such as a COVID-19 pandemic. We define the referral as coverage of health centres by hospitals. A hospital may also cover demand through referral. The proposed model is solved optimally for small problems. For large problems, we propose a customised genetic algorithm. Computational study shows that the GA performs well, and the partial coverage substantially affects the optimal solutions. [Submitted: 20 January 2021; Accepted: 15 January 2022]

Subject Keywords

hierarchical maximal covering location problem, partial coverage, gradual coverage, referral, heuristics, genetic algorithm, FACILITY LOCATION, GENETIC ALGORITHMS

URI

https://hdl.handle.net/11511/102210

Journal

EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING

DOI

https://doi.org/10.1504/ejie.2023.127742

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

A maximal covering location model in the presence of partial coverage Karasakal, O; Karasakal, Esra (2004-08-01) The maximal covering location problem (MCLP) addresses the issue of locating a predefined number of facilities in order to maximize the number of demand points that can be covered. In a classical sense, a demand point is assumed to be covered completely if located within the critical distance of the facility and not covered at all outside of the critical distance. Since the optimal solution to a MCLP is likely sensitive to the choice of the critical distance, determining a critical distance value when the c...
A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage Karasakal, Esra (2016-04-01) In this study, we present a bi-objective facility location model that considers both partial coverage and service to uncovered demands. Due to limited number of facilities to be opened, some of the demand nodes may not be within full or partial coverage distance of a facility. However, a demand node that is not within the coverage distance of a facility should get service from the nearest facility within the shortest possible time. In this model, it is assumed that demand nodes within the predefined distanc...
Hierarchical maximal covering location problem with referral in the presence of partial coverage Töreyen, Özgün; Karasakal, Esra; Department of Operational Research (2007) We consider a hierarchical maximal covering location problem to locate p health centers and q hospitals in such a way that maximum demand is covered, where health centers and hospitals have successively inclusive hierarchy. Demands are 3 types: demand requiring low-level service only, demand requiring high-level service only, and demand requiring both levels of service at the same time. All types of requirements of a demand point should be either covered by hospital providing both levels of service or refer...
A biobjective hierarchical location-allocation approach for the regionalization of maternal-neonatal care Karakaya, Sakir; Meral, Fatma Sedef (2022-02-01) This study proposes a biobjective location-allocation model for the regionalization of maternal-neonatal care to increase both accessibility and cost-efficiency by minimizing total transportation costs to public in accessing services and total service costs to government simultaneously. The model is characterized by a three-level successively inclusive hierarchy with an integrated flow and bidirectional referrals. Since it is difficult to solve for the optimum in a reasonable time, three heuristics are deve...
An interactive evolutionary algorithm for the multiobjective relocation problem with partial coverage Orbay, Berk; Karasakal, Esra; Department of Operational Research (2011) In this study, a bi-objective capacitated facility location problem is presented which includes partial coverage concept and relocation of facility nodes. In partial coverage, a predefined distance between a demand node and a facility node is assumed to be fully covered. After the predefined distance, the service level commences to decay linearly. The problem is designed to consider the existence of already functioning facility nodes. It is allowed to close these existing facilities and open new facilities ...

Citation Formats

O. Karasakal, E. Karasakal, and O. Toreyen, “A partial coverage hierarchical location allocation model for health services,” EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, vol. 17, no. 1, pp. 115–147, 2023, Accessed: 00, 2023. [Online]. Available: https://hdl.handle.net/11511/102210.