We study the system optimum dynamic traffic assignment (SODTA) in a network consisting of a freeway and neighboring city streets. There is only one bottleneck in the freeway and every destination is somewhere downstream of the bottleneck. Vehicles can be diverted through off-ramps leading to alternative local street routes. We formulate the problem and determine a graphical solution procedure based on Newell's cumulative plots, which yields the optimal diverted flow over time. On-ramps can be conveniently incorporated in this procedure yielding SO metering rates. The following variants are considered: capacitated and uncapacitated off-ramps, and deterministic and stochastic demand.
[1]
Haitham Al-Deek.
The Role Of Advanced Traveller Information Systems In Incident Management
,
1992
.
[2]
Athanasios K. Ziliaskopoulos,et al.
A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem
,
2000,
Transp. Sci..
[3]
C. Daganzo.
THE CELL TRANSMISSION MODEL..
,
1994
.
[4]
Carlos F. Daganzo,et al.
The Access-Control Problem on Capacitated FIFO Networks With Unique O-D Paths is Hard
,
2002,
Oper. Res..
[5]
Gordon F. Newell,et al.
Traffic flow on transportation networks
,
1980
.