Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

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

10 references·1 citing·45 second hop

FromToDepth

this work references cited by second hop

References

1981Schedule Delay and Departure Time Decisions in a Deterministic Model300 cited
1970Braess's paradox of traffic flow210 cited
1993A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks170 cited
1993Properties of Dynamic Traffic Equilibrium Involving Bottlenecks, Including a Paradox and Metering100 cited
1998A capacity paradox in network design and how to avoid it100 cited
1990Equilibrium Queueing Patterns at a Two-Tandem Bottleneck during the Morning Peak83 cited
1969Congestion Theory and Transportation Investment68 cited
1993DYNAMIC EQUILIBRIUM ASSIGNMENT WITH QUEUES FOR A ONE-TO-MANY OD PATTERN.54 cited
1978In a road network, increasing delay locally can reduce delay globally46 cited
1996An exact expression of dynamic traffic equilibrium25 cited

Cited by

2007System optimal traffic assignment with departure time choice5 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work