We prove the maximum principle for a discontinuous Galerkin (DG) method applied to the numerical solution of traffic flow problems on networks described by the Lighthill-Whitham-Richards equations. The paper is a followup of the preceding paper, Part I, where $L^2$ stability of the scheme is analyzed. At traffic junctions, we consider numerical fluxes based on Godunov’s flux derived in our previous work. We also construct a new Godunov-like numerical flux taking into account right of way at the junction...

We study the stability of a discontinuous Galerkin (DG) method applied to the numerical solution of traffic flow problems on networks. We discretize the Lighthill-Whitham-Richards equations on each road by DG. At traffic junctions, we consider two types of numerical fluxes that are based on Godunov’s numerical flux derived in a previous work of ours. These fluxes are easily constructible for any number of incoming and outgoing roads, respecting the drivers’ preferences. The analysis is split into...