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.