A Dynamic Traffic Assignment Method for Planning and Telematic Applications



A Dynamic Traffic Assignment Method for Planning and Telematic Applications

Authors

FRIEDRICH M, HOFS.~B I, N(3KEL K and VORTISCH P, PTV AG, Germany

Description

For traditional transportation planning, static assignment models which produce realistic spatial distributions of traffic have been used for many decades and are still employed today. Planning and operation of complex traffic control measures based on tr

Abstract

For traditional transportation planning, static assignment models which produce realistic spatial distributions of traffic have been used for many decades and are still employed today. Planning and operation of complex traffic control measures based on transport telematic applications require a more realistic modelling of temporal dynamics. State-of-the-art transport demand models provide origin-destination (o-d) matrices in high temporal resolutions, so that matrices for time slices of less than one hour are available as input for traffic assignment. Likewise, the supply can be dynamic in time as road capacities may vary within the course of the day due to traffic control or construction sites. Practical applications require a traffic assignment method which considers temporal dynamics in demand and supply whilst still being capable of handling real-life network sizes.

One possible approach to dynamic assignment is the extension of microscopic traffic flow models by route choice models. Some of these models are already available for practical applications, but inherently require long computing times. Approaching the problem from the opposite side, this paper will present a dynamic traffic assignment method based on the extension of an existing static assignment method developed by Lohse (1997).

Publisher

Association for European Transport