Priority-based Riemann solver for traffic flow on networks
From MaRDI portal
Publication:1708232
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.
Recommendations
- Continuous Riemann solvers for traffic flow at a junction
- The Riemann problem at a junction for a phase transition traffic model
- A Riemann solver at a junction compatible with a homogenization limit
- The Riemann solver for traffic flow at an intersection with buffer of vanishing size
- Phase transition model for traffic at a junction
Cited in
(9)- A simple fluid model for servicing priority traffic
- Pareto-optimal coupling conditions for the Aw-Rascle-Zhang traffic flow model at junctions
- Godunov-like numerical fluxes for conservation laws on networks
- The Riemann solver for traffic flow at an intersection with buffer of vanishing size
- Continuous Riemann solvers for traffic flow at a junction
- Entropy Dissipation at the Junction for Macroscopic Traffic Flow Models
- Emissions minimization on road networks via generic second order models
- Navigation system-based routing strategies in traffic flows on networks
- Microscopic selection of solutions to scalar conservation laws with discontinuous flux in the context of vehicular traffic
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)
