Oparauwah Nnaemeka Macdonald

The Importance of Dijkstra Graph Algorithm in Route Opimization

Comparative analysis against A* search Algorithm, ALT, ALT (A* search Landmarks and Triangle inequality), and Arc Flags algorithms demonstrated that Dijkstra consistently achieved faster computation times, lower memory overhead, and higher accuracy in path selection, resulting in significant reductions in delivery and planning time.