traffic flow on networks
DESCRIPTION
Traffic flow on networks. Benedetto Piccoli Istituto per le Applicazioni del Calcolo “Mauro Picone” – CNR – Roma Joint work with G. Bretti, Y. Chitour, M. Garavello, R.Natalini , A. Sgalambro. Macroscopic models. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/1.jpg)
Traffic flow on networks
Benedetto Piccoli
Istituto per le Applicazioni del Calcolo “Mauro Picone” – CNR – Roma
Joint work with G. Bretti, Y. Chitour, M. Garavello, R.Natalini , A. Sgalambro
![Page 2: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/2.jpg)
Macroscopic models
Vehicular traffic can be treated in different ways with microscopic,mesoscopic or macroscopic models.
Macroscopic models mimic some phenomena such as the creation ofshocksshocks and their propagation backwards along the road, since they candevelop discontinuities in a finite time even starting from smooth data.
Representation of intersections:
- Backward propagation of queues
- Distribution of flow capacity resource on the downstream links of a node to its upstream links
![Page 3: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/3.jpg)
LWR model
Fluidodynamical models for traffic flow
Example
M.J. Lighthill, G.B. Whitham, Richards 1955
![Page 4: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/4.jpg)
Traffic features difficult to reproduce:
traffic jams
Empirical Evidences:
1) Once created, jams are stable and can move for hours against the flow of traffic
2) The flow out of a jam is a stable, reproducible quantity
![Page 5: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/5.jpg)
Bilinear model
• Simple model with reasonable properties
• Two characteristic velocities
• Respect phenomenon of backward moving clusters
![Page 6: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/6.jpg)
Fluidodynamical models for traffic flow
Aw Rascle model
Aw Rascle model solves typical problems of second order models: Cars going backwards!
Other models: Greenberg, Helbing, Klar, Rascle, Benzoni - Colombo, etc.
![Page 7: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/7.jpg)
Road networks
• Road networds consists of a finite set of roads with junctions connecting roads :
Problem: how to define a solution at junctions.
![Page 8: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/8.jpg)
Solutions at junctions
Solve the Riemann problem at junctions
(A) There are prescribed preference of drivers, i.e. traffic from incoming roads distribute on outgoing roads according to fixed (probabilistic) coefficients
(B) Respecting rule (A) drivers behave so as to maximize flow.
REMARK:-The only conservation of cars does not give uniqueness- Rule (A) implies conservation of cars- The only rule (A) does not give uniqueness
![Page 9: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/9.jpg)
Rules (A) and (B)
Rule (A) corresponds to fix a traffic distribution matrix
Using rule (A) and (B) (under generic assumption on the matrix A), it is possible to define a unique solution to Riemann problems at junctions.
Remark: other definition given by Holden-Risebro ’95.
![Page 10: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/10.jpg)
LP problem at junctions
It is enough to solve a LP problem at junctions for incoming fluxes!Then other fluxes and densities are determined.
Other way of looking: Demand – Supply of J.P. Lebacque
![Page 11: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/11.jpg)
Solutions via WFT for 2x2 junctions
![Page 12: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/12.jpg)
Continuous dependence
Lipschitz continuous dependence does not hold: explicit counterexample.
Open problems: control the BV norm of density, extension to networks with any junction.
Lipschitz continuous dependence holds only for:
1. Single crossing with assumptions on initial data.
2. Small BV perturbations of generic equilibria.
Open problem: continuous dependence.
![Page 13: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/13.jpg)
Numerical approximation
Approximation schemes (explicit schemes): - Godunov’s scheme (first order)
- Kinetic scheme (kinetic scheme with 2 or 3 velocities) of first order (Aregba-Driollet – NataliniAregba-Driollet – Natalini)
- Kinetic scheme with 3 velocities of second order (Aregba-Driollet – NataliniAregba-Driollet – Natalini)
![Page 14: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/14.jpg)
Godunov schemeConstruct piecewise constant approximation of the initial data :
The scheme defines recursively
starting from .
CFL-like condition:
The projection of the exact solution on a piecewise constant function is:
These values are computed with the Gauss-Green formula.
![Page 15: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/15.jpg)
Godunov’s scheme
The scheme reads:
with the numerical flux (associated to flux function ):
![Page 16: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/16.jpg)
Kinetic scheme
Advantages of kinetic scheme: Extension to High order No instability at the boundary
Drawback: Diffusivity at first order for 2 velocities (Lax-Friedrichs
scheme).
Godunov scheme: Kinetic scheme:
![Page 17: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/17.jpg)
![Page 18: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/18.jpg)
Simulation on Rome road network
![Page 19: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/19.jpg)
Simulation on Rome road network
![Page 20: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/20.jpg)
LP solvers
![Page 21: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/21.jpg)
Running times
![Page 22: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/22.jpg)
Large simulations
Necessity of simulating networks with thousands of arcs and nodes
Fast simulation to apply for optimization problems
Elaboration of big data bases for network characteristic
Visualization time
![Page 23: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/23.jpg)
Modified Godunov
IDEA: Use bilinear model to have simplified choices of Numerical fluxed
![Page 24: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/24.jpg)
FVST scheme
2. Make use of theoretical results to bound the number of regimes changes
3. Track exactly regimes changes or separating shocks and use simple dynamics for one-sided zones
1. Use simplified flux function with two characteristic speed
![Page 25: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/25.jpg)
FVST scheme
Finite volumes shock tracking scheme: Strongly bounded computational times Error due only to initial data rounding
and junction data rounding Bounded to solutions for empty initial
network
![Page 26: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/26.jpg)
Comparison of schemes
![Page 27: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/27.jpg)
Salerno network simulation
![Page 28: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/28.jpg)
Networks and Heterogeneous Media
![Page 29: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/29.jpg)
![Page 30: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/30.jpg)
Packets flow on telecommunication networks
Benedetto Piccoli
Istituto per le Applicazioni del Calcolo “Mauro Picone” – CNR – Roma
Joint work with C. D’Apice, R. Manzo, A. Marigo
![Page 31: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/31.jpg)
Packets flow on telecommunication networks
Telecommunication networks as Internet: no conservation of packets at small time scales.
Assume there exists a loss probability function and packets are re-sent if lost.
Then at 1st step: (1-p) packets sent, p lost at 2nd step: p(1-p) packets sent, p^2 lost…. at kth step: p^(k-1) (1-p) sent, p^k lost …
Finally the average transmission time and velocity are:
![Page 32: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/32.jpg)
Riemann problems at junctions
Maximize the fluxes over incoming and outgoing lines: remove rule (A)
![Page 33: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/33.jpg)
Riemann problems at junctions
![Page 34: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/34.jpg)
BV EstimatesFor interactions with a junction we get:
For special flux fuction we get BV estimates on the densities.
![Page 35: Traffic flow on networks](https://reader035.vdocument.in/reader035/viewer/2022062803/5681484f550346895db56200/html5/thumbnails/35.jpg)
Lipschitz continuous dependence
Lemma