Numerical approximations of a traffic flow model on networks

We consider a mathematical model for fluid-dynamic flows on networks which is based on conservation laws. Road networks are considered as graphs composed by arcs that meet at some junctions. The crucial point is represented by junctions, where interactions occur and the problem is underdetermined. The approximation of scalar conservation laws along arcs is carried out by using conservative methods, such as the classical Godunov scheme and the more recent discrete velocities kinetic schemes with the use of suitable boundary conditions at junctions. Riemann problems are solved by means of a simulation algorithm which proceeds processing each junction. We present the algorithm and its application to some simple test cases and to portions of urban network.