System optimum dynamic traffic assignment graphical solution method for a congested freeway and one destination

doi:10.1016/j.trb.2005.01.001

System optimum dynamic traffic assignment graphical solution method for a congested freeway and one destination

2006-01-01

30

PRE

AI

DOI：10.1016/j.trb.2005.01.001

原文链接

原文求助

摘要

En 中文

This paper studies the system optimum dynamic traffic assignment in a network consisting of a hypothetical surface street grid and a congested freeway section. Vehicles can be diverted through off-ramps, and on-ramps can be metered. The family of solutions are identified graphically using Newell's queueing diagrams. Because enforcing diversion is still a technological puzzle, these results provide a benchmark for future ITS applications, and a building-block for including both departure time choice and several destinations. It is also shown that pricing according to marginal cost would be difficult to implement in this case, that eliminating all queues from the freeway is always suboptimal, and that ramps near the bottleneck should be metered more severely. (c) 2005 Elsevier Ltd. All rights reserved.

System optimum dynamic traffic assignment graphical solution method for a congested freeway and one destination

摘要

AI总结

期刊

机构

引用论文