A Dynamic Traffic Assignment Model and a Solution Algorithm.

This paper is concerned with the modeling of the Dynamic Traffic Assignment Problem (DTAP) for predicting the flows of urban transportation networks, mainly at peak periods. During the past 40 years, most of the research has been for the Static Traffic Assignment Problem (STAP) where it is assumed that demand is constant over time. This assumption is realistic for the analysis of intercity freight transportation networks over long periods of time, but it does not hold in an urban area, for simulating the flow variations during short periods (peak hours). Hence, during the past 20 years, the interest to the DTAP has been increasing. The seventies have been a transition period between heuristic models (where the demand is assigned to instantaneous minimum cost paths), and optimization models that take into account the demand over the whole study horizon of time, but all of them incorporate important limitations (only one destination; unrealistic conditions on the cost functions so that the flow "reaches" the destination; possible violation of the link capacities; etc.). In this paper, we propose a Dynamic Traffic Assignment Model which is mainly based on the following assumption: the time spent by a vehicle on a link may be decomposed into a fixed travel time plus a waiting time. The fixed travel time corresponds to the free or uncongested travel time over the link. Then the vehicle is put in an exit queue (which resides on the same link) until it becomes possible to enter a forward link; this decision is based on the link costs and their capacities. We show that this model leads to a network structure (a temporal expansion of the base network, including the queues) and therefore the DTAP may be viewed as a "simple" STAP over the expanded network. Hence, all the theories... [ABSTRACT FROM AUTHOR]