The dynamics of iterated transportation simulations
| dc.creator | Nagel, Kai | |
| dc.creator | Rickert, Marcus | |
| dc.creator | Simon, Patrice M. | |
| dc.creator | Pieck, Martin | |
| dc.date | 2000-02-23 | |
| dc.date.accessioned | 2026-07-07T05:32:42Z | |
| dc.date.available | 2026-07-07T05:32:42Z | |
| dc.description | Iterating between a router and a traffic micro-simulation is an increasibly accepted method for doing traffic assignment. This paper, after pointing out that the analytical theory of simulation-based assignment to-date is insufficient for some practical cases, presents results of simulation studies from a real world study. Specifically, we look into the issues of uniqueness, variability, and robustness and validation. Regarding uniqueness, despite some cautionary notes from a theoretical point of view, we find no indication of ``meta-stable'' states for the iterations. Variability however is considerable. By variability we mean the variation of the simulation of a given plan set by just changing the random seed. We show then results from three different micro-simulations under the same iteration scenario in order to test for the robustness of the results under different implementations. We find the results encouraging, also when comparing to reality and with a traditional assignment result. Keywords: dynamic traffic assignment (DTA); traffic micro-simulation; TRANSIMS; large-scale simulations; urban planning | |
| dc.description | 24 pages, 7 figures | |
| dc.identifier | https://arxiv.org/abs/nlin/0002040 | |
| dc.identifier | http://arxiv.org/abs/nlin/0002040 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/79749 | |
| dc.subject | Adaptation and Self-Organizing Systems | |
| dc.subject | Computational Engineering, Finance, and Science | |
| dc.title | The dynamics of iterated transportation simulations | |
| dc.type | text |