Structure of a Dynamic Network Loading Model for the Evaluation of Control Strategies

  • Massimo Di Gangi
  • Vittorio Astarita
Part of the Transportation Analysis book series (TRANSANALY)


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.


Transportation Research Choice Rule Link Modelization Traffic Assignment Cluster Rate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    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
  2. [2]
    Ben Akiva M., De Palma A., and Kanaraglou P. (1986), “Dynamic Model of Peak Period Traffic Congestion with Elastic Arrival Rates”, Transportation Science 20 (2), 164–181.CrossRefGoogle Scholar
  3. [3]
    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
  4. [4]
    Carey, M. (1986), “A constraint qualification for a dynamic traffic assignment model“, Operations Research 35 No.5, 55–58.Google Scholar
  5. [5]
    Carey, M. (1987), “Optimal time-varying flows on congested networks”, Operations Research 35 No.5, 58–69.CrossRefGoogle Scholar
  6. [6]
    Cascetta E. and Cantarella G.E. (1991), “A Day-to-day and Withinday Dynamic Stochastic Assignment Model”, Transportation Research 25a (5).Google Scholar
  7. [7]
    Di Gangi M. (1993), “A model for DNL allowing while-trip rerouting”, submitted to Mathematical modelling of Systems.Google Scholar
  8. [8]
    Friesz T.L., Luque J., Tobin R.L., Wie B.W., (1989), “Dynamic network traffic assignment considered as continuous time optimal control problem”, Operations Research 37, 893–901.CrossRefGoogle Scholar
  9. [9]
    Hammerslag R. (1988), “A three-dimensional assignment in the timespace”, UTSG Annual Conference 1988, London.Google Scholar
  10. [10]
    Janson B.N. (1989), “Dynamic traffic assignment for urban road networks”Transportation Research 25B (2/3), 143–161. Google Scholar
  11. [11]
    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
  12. [12]
    Merchant D.K., Nemhauser G.L. (1978), “A model and an algorithm for the dynamic traffic assignment problems”, Transportation Science 12 (3), 183–207.CrossRefGoogle Scholar
  13. [13]
    Papageorgiou M. (1990), “Dynamic modelling, assignment, and route guidance in traffic networks”, Transportation Research 24B (6), 471–495.Google Scholar
  14. [14]
    Vythoulkas P.K. (1990), “A Dynamic Stochastic Assignment Model for the Analysis of General Networks”, Transportation Research 24B (6), 453–469.Google Scholar
  15. [15]
    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
  16. [16]
    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
  17. [17]
    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

Copyright information

© Springer-Verlag Berlin. Heidelberg 1996

Authors and Affiliations

  • Massimo Di Gangi
    • 1
  • Vittorio Astarita
    • 1
  1. 1.Dipartimento di Ingegneria dei TrasportiUniversità degli Studi di Napoli “Federico II”NapoliItaly

Personalised recommendations