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

This paper deals with a model dealing with conservation laws on networks and coupled boundary conditions at the junctions. The authors introduce buffers of fixed arbitrary size and time-dependent split ratios at the junctions, which represent how traffic is routed through the network, while guaranteeing spill-back phenomena at nodes. Using the Hamilton-Jacobi equivalent formulation of the LWR model they write the boundary datum of incoming and outgoing junctions as functions of the queue sizes and vice-versa. They prove the well-posedness of the model and detail how to apply the framework to a non-trivial road network, with several intersections and finite-length links.