Dynamic flows with adaptive route choice
2020
We study dynamic network flows and introduce a notion of instantaneous dynamic equilibrium (IDE) requiring that for any positive inflow into an edge, this edge must lie on a currently shortest path towards the respective sink. We measure current shortest path length by current waiting times in queues plus physical travel times. As our main results, we show:
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
25
References
13
Citations
NaN
KQI