An easy-to-use algorithm for simulating traffic flow on networks: theoretical study (Q480088)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6377862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An easy-to-use algorithm for simulating traffic flow on networks: theoretical study |
scientific article; zbMATH DE number 6377862 |
Statements
An easy-to-use algorithm for simulating traffic flow on networks: theoretical study (English)
0 references
8 December 2014
0 references
LWR model
0 references
Godunov scheme
0 references
multi-population model
0 references
multi-path model
0 references
multi-commodity model
0 references
multi-class model
0 references
source-destination model
0 references
buffer model
0 references
traffic flow
0 references
networks
0 references
0 references
0 references
0.9262346625328064
0 references
0.8255119323730469
0 references
0.8236358761787415
0 references
0.8115864396095276
0 references
0.796442985534668
0 references
