An Application of Bellman-Ford Algorithm on The Ambulance Routing

Djihad Wungguli; Hendra Gemu; Nurwan Nurwan; Hasan S. Panigoro

doi:10.2991/978-2-38476-410-5_5

<Previous Article In Volume

Next Article In Volume>

An Application of Bellman-Ford Algorithm on The Ambulance Routing

Authors

Djihad Wungguli¹^{, *}, Hendra Gemu¹, Nurwan Nurwan¹, Hasan S. Panigoro¹

¹Universitas Negeri Gorontalo, Gorontalo, Indonesia

^*Corresponding author. Email: djihad@ung.ac.id

Corresponding Author

Djihad Wungguli

Available Online 28 July 2025.

DOI: 10.2991/978-2-38476-410-5_5 How to use a DOI?
Keywords: bellman-ford algorithm; shortest path; optimal route; ambulance routing
Abstract: Ambulance is a transport service for patients to the hospital. In order to minimize the risk level for patients, the ambulance should arrive at the incident site within the targeted time. This is why a mathematical method application can solve the issue by selecting the rigth route. The Bellman-Ford algorithm is an algorithm that is often used in solving a problem, i.e., finding the shortest route. This algorithm uses a vertex as a starting point and is used as a single source to calculate the shortest distance on a weighted graph. Findings reveal that the best route using the Bellman-Ford algorithm from samples that are obtained from several hospitals and health centers in Gorontalo city is 1-2-3-9-10-11-14-15 where the starting point is the Regional Hospital of Otanaha, and the destination point is the regional hospital of Prof. Dr. H. Aloe Saboe, and 1-3-4-10-11-12 where the starting point is the Health Center of Kota Selatan and the destination point is the Regional Hospital of Prof. Dr. H. Aloe Saboe.
Copyright: © 2025 The Author(s)
Open Access: Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Download article (PDF)

<Previous Article In Volume

Next Article In Volume>

Volume Title: Proceedings of the 2nd International Conference on Sciences, Mathematics, and Education 2023 (ICOSMED 2023)
Series: Advances in Social Science, Education and Humanities Research
Publication Date: 28 July 2025
ISBN: 978-2-38476-410-5
ISSN: 2352-5398
DOI: 10.2991/978-2-38476-410-5_5 How to use a DOI?
Open Access: Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Cite this article

ris enw bib

TY  - CONF
AU  - Djihad Wungguli
AU  - Hendra Gemu
AU  - Nurwan Nurwan
AU  - Hasan S. Panigoro
PY  - 2025
DA  - 2025/07/28
TI  - An Application of Bellman-Ford Algorithm on The Ambulance Routing
BT  - Proceedings of the 2nd International Conference on Sciences, Mathematics, and Education 2023 (ICOSMED 2023)
PB  - Atlantis Press
SP  - 41
EP  - 55
SN  - 2352-5398
UR  - https://doi.org/10.2991/978-2-38476-410-5_5
DO  - 10.2991/978-2-38476-410-5_5
ID  - Wungguli2025
ER  -

download .riscopy to clipboard