ORIGINAL PAPER

Discontinuous Galerkin Method for Macroscopic Traffic Flow Models on Networks

Expand
  • Faculty of Mathematics and Physics, Charles University, Sokolovská 49/83, 186 00 Prague, Czech Republic

Received date: 2020-08-24

  Revised date: 2021-09-02

  Online published: 2022-07-04

Supported by

The work of L. Vacek is supported by the Charles University, project GA UK No. 1114119. The work of V. Kučera is supported by the Czech Science Foundation, project No. 20-01074S.

Abstract

In this paper, we describe a numerical technique for the solution of macroscopic traffic flow models on networks of roads. On individual roads, we consider the standard Lighthill-Whitham-Richards model which is discretized using the discontinuous Galerkin method along with suitable limiters. To solve traffic flows on networks, we construct suitable numerical fluxes at junctions based on preferences of the drivers. We prove basic properties of the constructed numerical flux and the resulting scheme and present numerical experiments, including a junction with complicated traffic light patterns with multiple phases. Differences with the approach to numerical fluxes at junctions from Čanić et al. (J Sci Comput 63: 233–255, 2015) are discussed and demonstrated numerically on a simple network.

Cite this article

Lukáš Vacek, Václav Kučera . Discontinuous Galerkin Method for Macroscopic Traffic Flow Models on Networks[J]. Communications on Applied Mathematics and Computation, 2022 , 4(3) : 986 -1010 . DOI: 10.1007/s42967-021-00169-8

References

[1] Čanić, S., Piccoli, B., Qiu, J., Ren, T.: Runge-Kutta discontinuous Galerkin method for traffic flow model on networks. J. Sci. Comput. 63, 233–255 (2015)
[2] Cockburn, B., Shu, C.-W.: TVB Runge-Kutta local projection discontinuous Galerkin finite element method for conservation laws II: general framework. Math. Comput. 52(186), 411–435 (1989)
[3] Cockburn, B., Karniadakis, G.E., Shu, C.-W.: Discontinuous Galerkin Methods, Theory, Computation and Applications. Lecture Notes in Computational Science and Engineering, vol. 11. Springer (2000)
[4] Dolejší, V., Feistauer, M.: Discontinuous Galerkin Method—Analysis and Applications to Compressible Flow. Springer, Heidelberg (2015)
[5] Garavello, M., Piccoli, B.: Traffic Flow on Networks, vol. 1. American Institute of Mathematical Sciences (AIMS), Springfield, MO (2006)
[6] Greenshields, B.D.: A study of traffic capacity. Highw. Res. Board 14, 448–477 (1935)
[7] Jüngel, A.: Modeling and numerical approximation of traffic flow problems. Universität Mainz (2002). https://www.asc.tuwien.ac.at/~juengel/scripts/trafficflow.pdf. Accessed 14 Aug 2020
[8] Kachroo, P., Sastry, S.: Traffic Flow Theory: Mathematical Framework. University of California, Berkeley (2012)
[9] Reed, W.H., Hill, T.R.: Triangular Mesh Methods for the Neutron Transport Equation, Tech. rep., Los Alamos Scientific Lab., N. Mex., USA (1973)
[10] Shu, C.-W.: Discontinuous Galerkin methods: general approach and stability. In: Numerical Solutions of Partial Differential Equations, pp. 149–201. Birkhäuser, Basel (2009)
[11] Van Wageningen-Kessels, F., van Lint, H., Vuik, K., Hoogendoorn, S.: Genealogy of traffic flow models. EURO J. Transp. Logist. 4(4), 445–473 (2015)
[12] Zhang, X., Xia, Y., Shu, C.-W.: Maximum-principle-satisfying and positivity-preserving high order discontinuous Galerkin schemes for conservation laws on triangular meshes. J. Sci. Comput. 50, 29–62 (2012)
Options
Outlines

/