Structure of a Dynamic Network Loading Model for the Evaluation of Control Strategies
The efforts spent by researchers in the last few years in traffic modelling have been focused on the modelization of dynamic behaviour of the several components making up a transportation system. In the field of traffic assignment a large amount of models and procedures have been proposed in order to perform Dynamic Network Loading (DNL) that is the reproduction of within-day variable link performances once given a corresponding O/D demand and users’ choice model. These models can be used to simulate the effects of regulation strategies on users’ behaviour. In this paper a continuous dynamic network loading model is described; it removes some of the drawbacks of other packet approach models proposed in literature and explicitly allows the en-route modification of followed path. An algorithmic development of the model and a set of examples on link modelization, while-trip re-routing modelization and evaluation of control strategies are also proposed.
Unable to display preview. Download preview PDF.
- Ben Akiva M., Cyna M., and De Palma A. (1984), “Dynamic Model of Peak Period Congestion”, Transportation Research 18B (4/5), 339–355.Google Scholar
- Boyce D.E., Bin Ran, LeBlanc L.J. (1991), “Dynamic User-Optimal traffic Assignment model: A new Model and Solution Technique”, submitted to Transportation Science. Google Scholar
- Carey, M. (1986), “A constraint qualification for a dynamic traffic assignment model“, Operations Research 35 No.5, 55–58.Google Scholar
- Cascetta E. and Cantarella G.E. (1991), “A Day-to-day and Withinday Dynamic Stochastic Assignment Model”, Transportation Research 25a (5).Google Scholar
- Di Gangi M. (1993), “A model for DNL allowing while-trip rerouting”, submitted to Mathematical modelling of Systems.Google Scholar
- Hammerslag R. (1988), “A three-dimensional assignment in the timespace”, UTSG Annual Conference 1988, London.Google Scholar
- Janson B.N. (1989), “Dynamic traffic assignment for urban road networks”Transportation Research 25B (2/3), 143–161. Google Scholar
- Leonard D.R., Tough J.B., Baguley P.C., (1978), “CONTRAM: A traffic assignment model for predicting flows and queues during peak periods”, TRRL Report 841, Crowtorne.Google Scholar
- Papageorgiou M. (1990), “Dynamic modelling, assignment, and route guidance in traffic networks”, Transportation Research 24B (6), 471–495.Google Scholar
- Vythoulkas P.K. (1990), “A Dynamic Stochastic Assignment Model for the Analysis of General Networks”, Transportation Research 24B (6), 453–469.Google Scholar
- Wie B.-W., Friesz T.L., and Tobin R.L. (1990), “Dynamic user optimal traffic assignment on congested multi-destination networks” Transportation Research 24B(6), 431–442.Google Scholar
- Yagar S. (1975), “CORQ - A Model for Predicting Flows and Queues in a Road Corridor”, Transportation Retsearch Record 533, pp. 77–87, TRB, National Research Council, Washington D.C.Google Scholar
- Fernandez J.E., De Cea J. (1994), “Flow propagation description in dynamic network assignment models”, Proceedings of TRISTAN II TRiennal International Symposium on Transportation ANalysis pp. 517–531, Capri, June 1994.Google Scholar