By rotating drivers through system-optimal routes over multiple days, a city can make average travel times equal across drivers while keeping each day's assignment system-optimal, yielding a Cyclical User Equilibrium.
Proof of the Claim 2.13 In this section, we prove that reduction of a Wardropian Cycle length by the flow partition method isNP-hard
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles
By rotating drivers through system-optimal routes over multiple days, a city can make average travel times equal across drivers while keeping each day's assignment system-optimal, yielding a Cyclical User Equilibrium.