An Enhanced Genetic Algorithm with Clustering for Optimizing Mobile Stroke Unit Deployment
(2024) 24th IEEE International Conference on Bioinformatics and Bioengineering, BIBE 2024 In 2024 IEEE 24th International Conference on Bioinformatics and Bioengineering, BIBE 2024- Abstract
Mobile stroke units (MSUs), which are specialized ambulances equipped with a brain imaging device and staffed with trained healthcare personnel, have the potential to provide rapid on-site diagnosis and treatment for stroke patients. However, efficient access to prehospital stroke care requires optimizing the placement of MSUs. The MSU allocation problem has been previously solved using a traditional genetic algorithm that utilizes random starting solutions. The use of random starting solutions can, however, cause the algorithm to converge slowly. This can be especially problematic if the initial solutions are significantly far from the global optimum. To address this problem, we propose an enhanced genetic algorithm with clustering... (More)
Mobile stroke units (MSUs), which are specialized ambulances equipped with a brain imaging device and staffed with trained healthcare personnel, have the potential to provide rapid on-site diagnosis and treatment for stroke patients. However, efficient access to prehospital stroke care requires optimizing the placement of MSUs. The MSU allocation problem has been previously solved using a traditional genetic algorithm that utilizes random starting solutions. The use of random starting solutions can, however, cause the algorithm to converge slowly. This can be especially problematic if the initial solutions are significantly far from the global optimum. To address this problem, we propose an enhanced genetic algorithm with clustering (EGAC), which is a time-efficient method to solve the MSU allocation problem by identifying the optimal locations of MSUs in a geographic region. By leveraging clustering, the EGAC provides diverse and comprehensive coverage, avoiding the pitfalls of starting with closely located and potentially less optimal solutions, thereby effectively steering and accelerating its convergence towards the optimal MSU placements. Our experimental results show that the EGAC significantly outperforms the traditional genetic algorithm, without cluster-based starting solutions, by achieving remarkably faster convergence toward the optimal solution for different number of MSUs to allocate. We validate the performance of the EGAC through qualitative and quantitative analyses.
(Less)
- author
- Abid, Muhammad Adil ; Holmgren, Johan ; Lorig, Fabian and Petersson, Jesper LU
- organization
- publishing date
- 2024
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- ambulance allocation, clustering, emergency medical service, fast convergence, genetic algorithm, healthcare, mobile stroke unit, Optimization
- host publication
- 2024 IEEE 24th International Conference on Bioinformatics and Bioengineering, BIBE 2024
- series title
- 2024 IEEE 24th International Conference on Bioinformatics and Bioengineering, BIBE 2024
- editor
- Filipovic, Nenad
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- 24th IEEE International Conference on Bioinformatics and Bioengineering, BIBE 2024
- conference location
- Kragujevac, Serbia
- conference dates
- 2024-11-27 - 2024-11-29
- external identifiers
-
- scopus:85217167249
- ISBN
- 9798331518622
- DOI
- 10.1109/BIBE63649.2024.10820448
- language
- English
- LU publication?
- yes
- additional info
- Publisher Copyright: © 2024 IEEE.
- id
- 77ab31d4-b890-4fd6-96dc-795db77d1c10
- date added to LUP
- 2025-05-05 13:58:54
- date last changed
- 2025-05-05 13:58:54
@inproceedings{77ab31d4-b890-4fd6-96dc-795db77d1c10,
abstract = {{<p>Mobile stroke units (MSUs), which are specialized ambulances equipped with a brain imaging device and staffed with trained healthcare personnel, have the potential to provide rapid on-site diagnosis and treatment for stroke patients. However, efficient access to prehospital stroke care requires optimizing the placement of MSUs. The MSU allocation problem has been previously solved using a traditional genetic algorithm that utilizes random starting solutions. The use of random starting solutions can, however, cause the algorithm to converge slowly. This can be especially problematic if the initial solutions are significantly far from the global optimum. To address this problem, we propose an enhanced genetic algorithm with clustering (EGAC), which is a time-efficient method to solve the MSU allocation problem by identifying the optimal locations of MSUs in a geographic region. By leveraging clustering, the EGAC provides diverse and comprehensive coverage, avoiding the pitfalls of starting with closely located and potentially less optimal solutions, thereby effectively steering and accelerating its convergence towards the optimal MSU placements. Our experimental results show that the EGAC significantly outperforms the traditional genetic algorithm, without cluster-based starting solutions, by achieving remarkably faster convergence toward the optimal solution for different number of MSUs to allocate. We validate the performance of the EGAC through qualitative and quantitative analyses.</p>}},
author = {{Abid, Muhammad Adil and Holmgren, Johan and Lorig, Fabian and Petersson, Jesper}},
booktitle = {{2024 IEEE 24th International Conference on Bioinformatics and Bioengineering, BIBE 2024}},
editor = {{Filipovic, Nenad}},
isbn = {{9798331518622}},
keywords = {{ambulance allocation; clustering; emergency medical service; fast convergence; genetic algorithm; healthcare; mobile stroke unit; Optimization}},
language = {{eng}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
series = {{2024 IEEE 24th International Conference on Bioinformatics and Bioengineering, BIBE 2024}},
title = {{An Enhanced Genetic Algorithm with Clustering for Optimizing Mobile Stroke Unit Deployment}},
url = {{http://dx.doi.org/10.1109/BIBE63649.2024.10820448}},
doi = {{10.1109/BIBE63649.2024.10820448}},
year = {{2024}},
}