Comparative Study of Various Algorithms for Solving Shortest Path Problem
Authors
Riko Herwanto1, *, Admi Syarif2, Akmal Junaidi2, Putra Pribowo3
1Doctoral Program in Sciences, Faculty of Mathematics and Sciences, Lampung University, Bandar Lampung, Indonesia, 35145
2Department of Computer Science, Faculty of Mathematics and Sciences, Lampung University, Bandar Lampung, Indonesia, 35145
3Magister Program of Computer Science, Faculty of Mathematics and Sciences, Lampung University, Lampung, Indonesia, 35145
*Corresponding author.
Corresponding Author
Riko Herwanto
Available Online 27 May 2025.
- DOI
- 10.2991/978-94-6463-730-4_8How to use a DOI?
- Keywords
- Artificial Intelligence; Dijkstra Algorithm; Genetic Algorithm; Network Optimization; Shortest Path Problem
- Abstract
The Shortest Path Problem (SPP) is one of the fundamental network optimization problems widely applied in various fields, including transportation and telecommunications. This research, which presents a novel approach, conducts a comparative study of various algorithms, including Genetic Algorithms (GA), the Munemoto Algorithm, and Dijkstra’s Algorithm. We focus on evaluating these approaches’ effectiveness and efficiency in solving SPP. Several numerical experiments were conducted using benchmark test problems from the literature. The results show that GA performs better for more significant problems in dynamic environments.
- 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.
Cite this article
TY - CONF AU - Riko Herwanto AU - Admi Syarif AU - Akmal Junaidi AU - Putra Pribowo PY - 2025 DA - 2025/05/27 TI - Comparative Study of Various Algorithms for Solving Shortest Path Problem BT - Proceedings of the 5th International Conference on Applied Sciences, Mathematics, and Informatics (ICASMI 2024) PB - Atlantis Press SP - 81 EP - 92 SN - 2352-541X UR - https://doi.org/10.2991/978-94-6463-730-4_8 DO - 10.2991/978-94-6463-730-4_8 ID - Herwanto2025 ER -