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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
