GPU-Accelerated Slime Mould Algorithm for Urgent Transportation in Disaster Response: A COVID-19 Application

In the face of increasing natural disasters, ensuring rapid patient transportation by Emergency Medical Services (EMS) is critical to saving lives. The Ambulance Dispatching and Relocation Problem (ADRP) poses a significant challenge, requiring swift allocation of limited ambulance resources. To address this issue, we propose a GPU-Accelerated Slime Mould Algorithm (GPU-SMA) designed for real-time decision-making in disaster scenarios. Our approach leverages the parallel processing power of GPUs using the Compute Unified Device Architecture (CUDA). This significantly reduces computational time, enabling faster and more effective optimization. Additionally, we introduce a new relocation policy that utilizes real-time ambulance data to maintain optimal ambulance positioning. Our method has been using real-world data from the COVID-19 pandemic in Chicago. The results show a remarkable 23x speedup on GeForce RTX 3090 and RTX A4000 GPUs compared to the serial implementation. GPU-SMA outperforms five leading parallel algorithms (GPU-PSO, GPU-APSO, GPU-HHO, GPU-FA, and GPU-BA) in efficiency and effectiveness. A Friedman test confirms the statistical significance of these results.

Authors

Institutions

Publication Details

Journal
International Journal of Computer Information Systems and Industrial Management Applications
Published
2025-05-29
DOI
https://doi.org/10.70917/ijcisim-2025-0026
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

GPU-Accelerated Slime Mould Algorithm for Urgent Transportation in Disaster Response: A COVID-19 Application

Habiba Drias, Khaled M. Elleithy, Celia Khelfa, Ilyes
International Journal of Computer Information Systems and Industrial Management Applications
Robotic Path Planning Algorithms
article

GPU-Accelerated Slime Mould Algorithm for Urgent Transportation in Disaster Response: A COVID-19 Application

Habiba Drias, Khaled M. Elleithy, Celia Khelfa, Ilyes
article en

Abstract

In the face of increasing natural disasters, ensuring rapid patient transportation by Emergency Medical Services (EMS) is critical to saving lives. The Ambulance Dispatching and Relocation Problem (ADRP) poses a significant challenge, requiring swift allocation of limited ambulance resources. To address this issue, we propose a GPU-Accelerated Slime Mould Algorithm (GPU-SMA) designed for real-time decision-making in disaster scenarios. Our approach leverages the parallel processing power of GPUs using the Compute Unified Device Architecture (CUDA). This significantly reduces computational time, enabling faster and more effective optimization. Additionally, we introduce a new relocation policy that utilizes real-time ambulance data to maintain optimal ambulance positioning. Our method has been using real-world data from the COVID-19 pandemic in Chicago. The results show a remarkable 23x speedup on GeForce RTX 3090 and RTX A4000 GPUs compared to the serial implementation. GPU-SMA outperforms five leading parallel algorithms (GPU-PSO, GPU-APSO, GPU-HHO, GPU-FA, and GPU-BA) in efficiency and effectiveness. A Friedman test confirms the statistical significance of these results.

International Journal of Computer Information Systems and Industrial Management ApplicationsVol. 17
University of Bridgeport (US), University of Sciences and Technology Houari Boumediene (DZ), University of Algiers Benyoucef Benkhedda (DZ)
Openalex Percentile: Top 89%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.