Traffic assignment

Every driver re-chooses a route after any change you make, so a toll moves traffic rather than removing it. Returns link flows, travel times, the network total, and what a toll did to all three.

Result

solving

Solving…

free flowingnear capacityover capacitycharged

Every road, with its flow

Road	Vehicles	State	Capacity

Inputs

Link to toll

Toll

In minutes of travel time drivers would pay to avoid the link.

Route-choice precision

Low spreads traffic over every plausible route; high piles it onto the fastest.

In Python

sq.RoutingProblem(network="sioux_falls", tolls={28: 5.0}, precision=0.5).solve() returns the same solution. An edge list of (from, to, free_flow, capacity) tuples works in place of the benchmark network.

Sioux Falls: 24 nodes, 76 links, published capacities, free-flow times and demand table (TNTP). Top 12 origin-destination pairs, three routes each.