A macroscopic traffic flow model with finite buffers on networks: well-posedness by means of Hamilton-Jacobi equations

DOI10.4310/CMS.2020.V18.N6.A4zbMath1465.35113OpenAlexW2962358947MaRDI QIDQ2023501

Paola Goatin, Alexandre M. Bayen, Nicolas Laurent-Brouty, Alexander Keimer

Publication date: 3 May 2021

Published in: Communications in Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/cms.2020.v18.n6.a4

zbMATH Keywords

conservation lawsnetworksHamilton-Jacobi equationsfixed-pointbuffersLWR modelboundary conditions at the junctions

Mathematics Subject Classification ID

Hyperbolic conservation laws (35L65) Traffic problems in operations research (90B20) Hamilton-Jacobi equations (35F21) Initial-boundary value problems for first-order hyperbolic equations (35L04) PDEs on graphs and networks (ramified or polygonal spaces) (35R02)

Related Items (3)

A proof of Kirchhoff's first law for hyperbolic conservation laws on networks ⋮ Time-Continuous Instantaneous and Past Memory Routing on Traffic Networks: A Mathematical Analysis on the Basis of the Link-Delay Model ⋮ Burgers' equation revisited: extension of mono-dimensional case on a network

This page was built for publication: A macroscopic traffic flow model with finite buffers on networks: well-posedness by means of Hamilton-Jacobi equations