A macroscopic traffic flow model with finite buffers on networks: well-posedness by means of Hamilton–Jacobi equations
A macroscopic traffic flow model with finite buffers on networks: well-posedness by means of Hamilton–Jacobi equations
We introduce a model dealing with conservation laws on networks and coupled boundary conditions at the junctions.In particular, we introduce buffers of fixed arbitrary size and timedependent split ratios at the junctions, which represent how traffic is routed through the network, while guaranteeing spill-back phenomena at nodes.Having defined the dynamics …