An easy-to-use algorithm for simulating traffic flow on networks: numerical experiments

Abstract

In this paper we propose a Godunov-based discretization of a hyperbolic system of conservation laws with discontinuous flux, modeling vehicular flow on a network. Each equation describes the density evolution of vehicles having a common path along the network. We show that the algorithm selects automatically an admissible solution at junctions, hence ad hoc external procedures (e.g., maximization of the flux via a linear programming method) usually employed in classical approaches are no needed. Since users have not to deal explicitly with vehicle dynamics at junction, the numerical code can be implemented in minutes. We perform a detailed numerical comparison with a Godunov-based scheme coming from the classical theory of traffic flow on networks which maximizes the flux at junctions.

Cited by in corpus (9)

• On the micro-to-macro limit for first-order traffic flow models on networks
• Transport of measures on networks
• An easy-to-use algorithm for simulating traffic flow on networks: theoretical study
• A destination-preserving model for simulating Wardrop equilibria in traffic flow on networks
• Two algorithms for a fully coupled and consistently macroscopic PDE-ODE system modeling a moving bottleneck on a road
• Inverting the Fundamental Diagram and Forecasting Boundary Conditions: How Machine Learning Can Improve Macroscopic Models for Traffic Flow
• An interface-free multi-scale multi-order model for traffic flow
• Comparing comparisons between vehicular traffic states in microscopic and macroscopic first-order models
• Macroscopic and multi-scale models for multi-class vehicular dynamics with uneven space occupancy: a case study