Priority-based Riemann solver for traffic flow on networks

From MaRDI portal
Publication:1708232

DOI10.4310/CMS.2018.V16.N1.A9zbMATH Open1395.90072arXiv1606.07418OpenAlexW2963317541MaRDI QIDQ1708232FDOQ1708232

Paola Goatin, Maria Laura Delle Monache, B. Piccoli

Publication date: 5 April 2018

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

Abstract: In this article we introduce a new Riemann solver for traffic flow on networks. The Priority Riemann solver (PRS) provides a solution at junctions by taking into consideration priorities for the incoming roads and maximization of through flux. We prove existence of solutions for the solver for junctions with up to two incoming and two outgoing roads and show numerically the comparison with previous Riemann solvers. Additionally, we introduce a second version of the solver that considers the priorities as softer constraints and illustrate numerically the differences between the two solvers.


Full work available at URL: https://arxiv.org/abs/1606.07418




Recommendations





Cited In (7)





This page was built for publication: Priority-based Riemann solver for traffic flow on networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1708232)