Abstract
AbstractWe 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:
existence and constructive computation of IDE flows for multi-source single-sink networks assuming constant network inflow rates,
finite termination of IDE flows for multi-source single-sink networks assuming bounded and finitely lasting inflow rates,
the existence of IDE flows for multi-source multi-sink instances assuming general measurable network inflow rates,
the existence of a complex single-source multi-sink instance in which any IDE flow is caught in cycles and flow remains forever in the network.
Funder
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献