Node and link models for network traffic flow simulation

Authors:
V. Astarita
Affiliations:
Dipartimento di Pianificazione Territoriale University of Calabria Arcavacata di Rende (CS), Italy
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2002

Citing 3
Cited 3

Optimal time-varying flows on congested networks

Operations Research
Dynamic network traffic assignment considered as a continuous time optimal control problem

Operations Research
A variational inequality formulation of the dynamic network user equilibrium problem

Operations Research

From the modelling of driver's behavior to hydrodynamic models and problems of traffic flow

Nonlinear Analysis: Real World Applications
Numerical algorithms for simulations of a traffic model on road networks

Journal of Computational and Applied Mathematics
Road traffic modelling and simulating with fluid-dynamic approach

MATH'07 Proceedings of the 11th WSEAS International Conference on Applied Mathematics

Quantified Score

Hi-index	0.98

Visualization

Abstract

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]). The connection 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.