Test Center Location Problem: A Bi-Objective Model and Algorithms
Algorithms · 25.03.2024 · 17 (4) · 135
DOI: 10.3390/a17040135 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algorithms, online erschienen am 25.03.2024. Verfasst von Mansoor Davoodi und 1 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 36 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
The optimal placement of healthcare facilities, including the placement of diagnostic test centers, plays a pivotal role in ensuring efficient and equitable access to healthcare services. However, the emergence of unique complexities in the context of a pandemic, exemplified by the COVID-19 crisis, has necessitated the development of customized solutions. This paper introduces a bi-objective integer linear programming model designed to achieve two key objectives: minimizing average travel time for individuals visiting testing centers and maximizing an equitable workload distribution among testing centers. This problem is NP-hard and we propose a customized local search algorithm based on the Voronoi diagram. Additionally, we employ an ϵ-constraint approach, which leverages the Gurobi solver. We rigorously examine the effectiveness of the model and the algorithms through numerical experiments and demonstrate their capability to identify Pareto-optimal solutions. We show that while the Gurobi performs efficiently in small-size instances, our proposed algorithm outperforms it in large-size instances of the problem.
Zitieren
APA
Davoodi, M., & Calabrese, J. M. (2024). Test Center Location Problem: A Bi-Objective Model and Algorithms. Algorithms, 17(4), 135. https://doi.org/10.3390/a17040135
Vancouver
Davoodi M, Calabrese JM. Test Center Location Problem: A Bi-Objective Model and Algorithms. Algorithms. 2024;17(4):135. doi:10.3390/a17040135
BibTeX
@article{Davoodi2024,
author = {Davoodi, Mansoor and Calabrese, Justin M.},
title = {Test Center Location Problem: A Bi-Objective Model and Algorithms},
journal = {Algorithms},
year = {2024},
volume = {17},
number = {4},
pages = {135},
doi = {10.3390/a17040135}
}
EUVIMED