This paper presents a comparative study of the Floyd-Warshall (FW) algorithm and the Simulated Annealing (SA) heuristic for solving shortest path problems in static and dynamic traffic-based graphs.

The study applies three shortest-path-finding algorithms namely Dijkstra's, Bellman-Ford and Floyd- Warshall Algorithms into a grocery store to provide users the shortest path to be traversed by the ...