Traffic-Aware Route Planning using A* Search

Find the minimum travel-time route between two junctions. Congestion scales every road's travel time, closed roads are removed from the graph, and Dijkstra checks that A* stays optimal.

cost(e) = d × t min · f(n) = g(n) + h(n) · h(n) = straight-line km ÷ 60 km/h

Result

Choose junctions and click Find Route.

Road network

Road labels

show h(n)

A* route Dijkstra route closed road numbers = order junctions were expanded click a junction: set start, then destination · click a road: close / reopen

All scenarios for this trip

Scenario	Route	Multiplier	Travel time	A* expanded	Dijkstra expanded	Same cost

API: POST /api/route {"start":"A","goal":"F","scenario":"peak","algorithm":"astar"} · CLI: python traffic_astar.py · synthetic dataset: data/nodes.csv, data/edges.csv

Plan a route

Result

Road network

All scenarios for this trip