<![CDATA[Static route calculations based purely on physical distance often fail to provide efficient directions during peak vacation seasons when traffic congestion occurs on critical tourism corridors in Tegal Regency, such as the route to Guci. This study proposes an optimization of the Dijkstra Algorithm by incorporating dynamic weighting functions derived from real-time traffic velocity parameters via the TomTom Traffic API. The traditional distance-based edge cost is transformed into a time-responsive cost function that adjusts adaptively to road density variables. The system models the road networks of Tegal Regency as a weighted directed graph consisting of intersections as vertices and road segments as edges. The results indicate that the modified Dijkstra algorithm successfully reroutes vehicles to alternative paths when the primary routes experience severe delays, reducing average travel time by up to 28.4% compared to the standard static distance Dijkstra. The computational verification demonstrates that dynamic edge updating provides high accuracy in pathfinding efficiency for regional spatial tourism planning. Keywords: Dijkstra Algorithm; Fastest Path; Graph Optimization; Rerouting; TomTom API.]]>
Copyrights © 2026
