- Quasi-equilibrium traffic assignment
- Efficient routing for millions of trips using contraction hierarchy and priority-queue based Dijkstra algorithm sp
- Temporal dynamics with residual demand, with time step of a few minutes
- Compatible with road network retrieved from OSMnx
- Calculating network traffic flow for small and large road networks (10 to 1,000,000 links) at sub-hourly time steps
- Visualizing traffic congestion dynamics throughout the day
- Assessing regional mobility and resilience with disruptions (e.g., road closure, seismic damages)
- Road Network
- nodes.csv
- edges.csv
- closed_edges.csv (designed for disruptive events)
- Demand
- OD.csv
- Travel time
- Travel route