Runge-Kutta discontinuous Galerkin method to model traffic flow on networks
Runge-Kutta discontinuous Galerkin method to model traffic flow on networks
kobra noreh1 morteza chaji2
1) MA oreientation numerical analysis
2) MA mathematical statistics
IOI Code
:
XYCZ-AAFGF
Publication :
International Conference on Engineering and Applied Science(iceasconf.com)
Abstract :
Runge-Kutta bounded discontinuous Galerkin method for numerical simulation of the traffic problems we recommend.
The graph modeling the network path that consists of a finite number of tracks which is the intersection of binding. In every direction, dynamics, numerical protection law that defines conditions for flow separation and connection fittings or convergence in areas where paths intersect, specifies. These conditions are binding in the context of serve. This approach to modeling problems Cauchy problems for traffic flow on the network for lack of uniqueness. It is an efficient way to network issues.
Keywords : runge kutta discontinuous galerkin method to model traffic flow on networks