Dynamic traffic assignment for urban road networks

Conference · Sat Jul 01 04:00:00 EDT 1989

OSTI ID:5312091

Janson, B N ^[1]

---

1. Oak Ridge National Lab., TN (USA)

This paper describes a dynamic traffic assignment (DTA) algorithm for urban road networks. The DTA algorithm is intended for application to large transportation planning networks with flow dependent travel costs and multiple origin and destination zones. The static user-equilibrium assignment problem (SUE) is a nonlinear programming problem with linear constraints that is typically solved by methods of linear combinations. The dynamic user-equilibrium assignment problem with multiple origins and destinations (DUE) is a nonlinear programming problem with nonlinear constraints that cannot be solved by these methods. Moreover, the constraints needed to ensure temporal flow continuity at the nodes cannot be properly specified within DUE. DTA is not a solution algorithm for DUE, but was designed instead to produce assignments that approximate the optimality conditions of DUE. Alternative approaches to dynamic assignment are discussed, including those that have been formulated as optimization problems and others that have been developed to simulate or approximate observed traffic conditions. Test results presented in this paper show that DTA generates both static and dynamic assignments that approximately satisfy the user-equilibrium conditions of those problems. 23 refs., 2 figs., 3 tabs.

• Research Organization: Oak Ridge National Lab., TN (USA)
• Sponsoring Organization: FHWA
• DOE Contract Number: AC05-84OR21400
• OSTI ID: 5312091
• Report Number(s): CONF-900121-2; ON: DE89016260
• Country of Publication: United States
• Language: English

Related Subjects

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATION
320203* -- Energy Conservation
Consumption
& Utilization-- Transportation-- Land & Roadway
ALGORITHMS
CONTROL
DYNAMICS
MATHEMATICAL LOGIC
MECHANICS
NONLINEAR PROGRAMMING
PROGRAMMING
TRAFFIC CONTROL
TRANSPORTATION SECTOR
URBAN AREAS
VEHICLES