HIGHLIGHTS
- who: Python and colleagues from the (UNIVERSITY) have published the article: dyntapy: dynamic and static traffic assignment in Python, in the Journal: (JOURNAL)
- what: The authors provide two algorithms for solving the deterministic Traffic Assignment Problem, namely, Dial`s Algorithm B (Dial, 2006) and the Method of Successive Averages. Support for intersection data both in the parser and as constraints in the models is a long term goal for dyntapy; however, data for intersections is currently not widely available.
SUMMARY
Published Statement of need Macroscopic Traffic Models, based on the idea . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.