Fast algorithms for the approximation of a traffic flow model on networks

DOI10.3934/DCDSB.2006.6.427zbMath1114.65099OpenAlexW2323437890MaRDI QIDQ2496589

Roberto Natalini, Gabriella Bretti, Benedetto Piccoli

Publication date: 11 July 2006

Published in: Discrete and Continuous Dynamical Systems. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/dcdsb.2006.6.427

zbMATH Keywords

finite difference schemestraffic flowscalar conservation lawsconservation equationflows on networks\(3\)-velocities kinetic schemefast Godunov schemefast shock fitting schemefluid-dynamic mathematical modellingnumerical Godunov schemetraffic and telecommunication networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Hyperbolic conservation laws (35L65) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Traffic problems in operations research (90B20)

Related Items (10)

Numerical discretization of coupling conditions by high-order schemes ⋮ Coupling traffic models on networks and urban dispersion models for simulating sustainable mobility strategies ⋮ Fluidsim: a car traffic simulation prototype based on fluiddynamic ⋮ Sensitivity analysis of permeability parameters for flows on Barcelona networks ⋮ Traffic Regulation via Controlled Speed Limit ⋮ Central schemes for networked scalar conservation laws ⋮ Discussion about traffic junction modelling: conservation laws vs Hamilton-Jacobi equations ⋮ A convergent scheme for Hamilton-Jacobi equations on a junction: application to traffic ⋮ Numerical simulations of traffic data via fluid dynamic approach ⋮ A Characteristic Particle Method for Traffic Flow Simulations on Highway Networks

This page was built for publication: Fast algorithms for the approximation of a traffic flow model on networks