Node and link models for network traffic flow simulation

In this paper, after introducing a classification of dynamic network loading (DNL) procedures (based on time, space, and demand discretization), many new methodologies recently presented are discussed. Some analytical properties of the point packet approach, recently studied by Chabini and Kachani [1], using generalized Dirac functions, are discussed, and results are extrapolated to the proposed procedure (called MICE [2]). nnection between the dynamic network loading procedure MICE and the analytical formulation presented in [3] is explained. The same demand discretization is suggested in the solution of all analytical traffic flow models.