Simultaneous departure time/route choices in queuing networks and a novel paradox
From MaRDI portal
Publication:2379706
Recommendations
Cites work
- A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
- An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues
- scientific article; zbMATH DE number 2096636 (Why is no real title available?)
- Optimal Time-Varying Flows on Congested Networks
- Properties of Dynamic Traffic Equilibrium Involving Bottlenecks, Including a Paradox and Metering
- Queue spillovers in transportation networks with a route choice
- Über ein Paradoxon aus der Verkehrsplanung
Cited in
(8)- On the equivalence between SUE and fixed-point states of day-to-day assignment processes with serially-correlated route choice
- The analysis of Braess' paradox and robustness based on dynamic traffic assignment models
- The classical Braess paradox problem revisited: a generalized inverse method on non-unique path flow cases
- A queueing framework for routing problems with time-dependent travel times
- The Downs-Thomson paradox: existence, uniqueness and stability of user equilibria
- A cumulative perceived value-based dynamic user equilibrium model considering the travelers' risk evaluation on arrival time
- Properties of Dynamic Traffic Equilibrium Involving Bottlenecks, Including a Paradox and Metering
- A framework to optimize air traffic system
This page was built for publication: Simultaneous departure time/route choices in queuing networks and a novel paradox
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379706)