Comparative Study of Various Algorithms for Solving Shortest Path Problem
Riko Herwanto, Admi Syarif, Akmal Junaidi, Putra Pribowo · Advances in physics research/Advances in Physics Research · 2025
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