A CAPACITY INCREASING PARADOX FOR A DYNAMIC TRAFFIC ASSIGNMENT WITH DEPARTURE TIME CHOICE

Abstract

This paper shows that the capacity increasing paradox in a transportation network also occurs under non-stationary settings, in particular, under dynamic traffic assignment with endogenous time-varying origin-destination (OD) demands. Analytical formulas for the solutions of the dynamic equilibrium assignment are explicitly derived for two kinds of networks: networks with a one-to-many OD pattern and reversed networks with a many-to-one OD pattern. The formulas clarify the significant difference in the properties of the two dynamic flow patterns. This leads to the finding that one of the crucial conditions that determines whether the paradox occurs or not is the OD pattern of the underlying networks.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 9 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.