Inspect the explanation.

What this exhibit shows

Adding a zero-cost connector can increase equilibrium trip time in a particular routing game. The same connector can help at lower demand. The selected numerical network is an illustrative model, not an observed city.

Mathematical source

Cornell: A Course in Networks and Markets, chapter 7 provides the network-routing and Braess’s-paradox context. SYSREON implemented the exhibit independently.

Model specification · shortcut-v1

Home → A and B → Work each cost x/100 minutes, with x the traffic on that edge. Home → B and A → Work each cost 45 minutes. The new connector is directed A → B and costs zero. Traffic is divisible; route choice is at equilibrium.

Without the connector, trip time = N/200 + 45. With it, time = N/50 for N ≤ 4,500; 90 for 4,500 < N < 9,000; and N/200 + 45 for N ≥ 9,000. At N = 4,000, the two answers are 65 and 80 minutes.

Limitations

The model excludes departure-time changes, intersections, physical queue spillback, heterogeneous drivers, and changing road capacity. Particle motion illustrates route use rather than vehicle physics. No live traffic data is used.

Publication use

The public demo is free to try and share by link. Embedding or republishing this implementation on another website requires the agreed pilot use agreement.

Privacy and operation

The exhibit does not set cookies, store responses, or send behavioral data to SYSREON. The optional embed loader exposes local reveal/explore events to the containing page, whose publisher controls any analytics. A public host may process ordinary access logs. No model inference is used during play.