User-equilibrium properties of fixed points in dynamic traffic assignment
DOI: 10.1016/s0968-090x(98)00005-9
archive: archived pipeline: cataloged verified
Get this paper ↗ (DOI — opens at the source; we link to it, we don't host it)
Summary
This paper addresses the problem of dynamic traffic assignment under the principle of user equilibrium, where individual drivers select fastest paths based on time-dependent link travel times. The authors critique classical approaches that attempt to model route choice and traffic dynamics within a single unified framework, noting that such models often suffer from restrictive equilibrium definitions or fail to establish the existence of solutions. Instead, the paper decomposes the problem into two distinct mappings: an assignment mapping, which determines link travel times resulting from a specific routing policy, and a routing mapping, which identifies the fastest paths given fixed link travel times. The core research question is whether user-equilibrium routing policies can be characterized as fixed points of the composition of these two mappings, and under what conditions such fixed points exist. The study first analyzes "all-or-nothing" routing, where traffic is routed entirely onto a single path. The authors demonstrate that in discrete-time models, fixed points are not guaranteed to exist due to the discreteness of routing choices, which can lead to cycling rather than convergence. To resolve this, the paper introduces "multipath" routing, where traffic flow is split fractionally across multiple paths. This approach allows for the application of fixed-point theory by treating routing policies as continuous variables. The authors develop iterative routing mappings that adjust routing splits incrementally based on "dynamic programming slacks," which measure the delay incurred by choosing suboptimal links. They define "balancing functions" that ensure the routing mapping is continuous and that fixed points correspond exactly to user-equilibrium conditions, where all used paths have equal duration and unused paths are not faster. The main findings establish sufficient conditions for the existence of user-equilibrium fixed points in continuous-time multipath routing. Theorem 3 proves that if the assignment mapping is continuous and yields time-continuous travel times, a fixed point exists within the space of all multipath policies. However, because this space lacks a metrizable topology, the authors provide Theorem 4, which establishes existence within a restricted domain of equicontinuous (Lipschitz continuous) routing policies, facilitating algorithmic analysis. Additionally, the paper constructs general balancing functions for nodes with more than two outgoing links using a hierarchical, tree-based decomposition of routing splits, proving that these functions correctly identify equilibrium states. The significance of this work lies in providing a rigorous theoretical foundation for dynamic user equilibrium that avoids the pitfalls of unified models. By characterizing equilibrium as a fixed point of decomposed mappings, the authors offer a framework that guarantees the existence of solutions under broad conditions. The proposed iterative methods and balancing functions serve as computationally viable heuristics for finding these equilibria, ensuring that if convergence occurs, the resulting policy satisfies user equilibrium. This approach clarifies the relationship between predictive routing strategies and traffic dynamics, offering a robust method for analyzing and computing dynamic traffic assignments.
Provenance
The full processing record for this entry. Every stage of this paper's journey through the pipeline is logged — what ran, with which tool and model, how many attempts it took, and when it last completed.
| Stage | Outcome | Tool | Model | Prompt | Attempts | Completed |
|---|---|---|---|---|---|---|
| discover | success | OpenAlex-citations | — | — | 1 | 2026-06-19 |
| archive | success | semantic_scholar | — | — | 6 | 2026-06-25 |
| extract | success | pdftotext | — | — | 2 | 2026-06-26 |
| clean | success | clean | — | — | 1 | 2026-06-26 |
| chunk | success | chunk | — | — | 1 | 2026-06-26 |
| embed | success | embed | Qwen/Qwen3-Embedding-8B | — | 1 | 2026-06-26 |
| enrich | failed | — | — | — | 4 | 2026-06-26 |
| promote | success | — | — | — | 1 | 2026-06-19 |
| summarize | success | llm | qwen3.6-27b-prismaquant | summ-v5 | 1 | 2026-06-26 |
| tag | success | vector_similarity | — | — | 6 | 2026-06-26 |
| verify | success | — | — | — | 1 | 2026-06-26 |
Summary generated by qwen3.6-27b-prismaquant on 2026-06-26; verification: verified.
Topics
Ranked by relevance to this paper. Hover a topic for its definition.