Priority-based Riemann solver for traffic flow on networks

TL;DR

This paper introduces a new Priority Riemann solver for traffic flow networks that considers road priorities and flux maximization, with proven existence of solutions and numerical comparisons to existing methods.

Contribution

The paper presents a novel Priority Riemann solver for traffic networks, including a softer constraint version, with theoretical existence proofs and numerical evaluations.

Findings

Existence of solutions for junctions with up to two incoming and outgoing roads.

Numerical comparison shows differences between the new and previous Riemann solvers.

The softer constraint version offers alternative solutions considering priority flexibility.

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.