Nash Flows Over Time with Spillback

Abstract

Modeling traffic in road networks is a widely studied but challenging problem, especially under the assumption that drivers act selfishly. A common approach used in simulation software is the deterministic queuing model, for which the structure of dynamic equilibria has been studied extensively in the last couple of years. The basic idea is to model traffic by a continuous flow that travels over time from a source to a sink through a network, in which the arcs are endowed with transit times and capacities. Whenever the flow rate exceeds the capacity a queue builds up and the infinitesimally small flow particles wait in line in front of the bottleneck. Since the queues have no physical dimension, it was not possible, until now, to represent spillback in this model. This was a big drawback, since spillback can be regularly observed in real traffic situations and has a huge impact on travel times in highly congested regions. We extend the deterministic queuing model by introducing a storage capacity that bounds the total amount of flow on each arc. If an arc gets full, the inflow capacity is reduced to the current outflow rate, which can cause queues on previous arcs and blockages of intersections, i.e., spillback. We carry over the main results of the original model to our generalization and characterize dynamic equilibria, called Nash flows over time, by sequences of particular static flows, we call spillback thin flows. Furthermore, we give a constructive proof for the existence of dynamic equilibria, which suggests an algorithm for their computation. This solves an open problem stated by Koch and Skutella in 2010 [12].

Dynamic Flows with Adaptive Route Choice

“…For every edge e ∈ E, we define a function F ∆ e denoting the total amount of flow currently on edge e (either waiting in its queue or traveling along the edge) for any time θ. As in [19], we call these the edge load functions:…”

“…Very recently, Cominetti, Correa and Olver [5] shed light on the behavior of steady state queues assuming single commodity networks and constant inflow rates. Sering and Vargas-Koch [19] analyzed the impact of spillbacks in the fluid queuing model and Bhaskar et al [1] devised Stackelberg strategies in order to improve the efficiency of dynamic equilibria.…”

Dynamic flows with adaptive route choice

“…Very recently, Cominetti et al [6] shed light on the behavior of steady state queues assuming single commodity networks and constant inflow rates. Sering and Vargas-Koch [21] analyzed the impact of spillbacks in the fluid queuing model and Bhaskar et al [1] devised Stackelberg strategies in order to improve the efficiency of dynamic equilibria.…”

Algorithms for Flows over Time with Scheduling Costs

“…Dynamic equilibria, which is the flow over time equivalent of Wardrop equilibria for static flows, are key objects of study. Existence, uniqueness, structural and algorithmic issues, and much more have been receiving increasing recent interest from the optimization community [4,5,6,7,16,22,23].…”

“…Consider for a moment the model where users cannot choose their departure time, but instead are released from the source at a fixed rate u 0 , and simply wish to reach the destination as early as possible. This is the game-theoretic model that has received the most attention from the flow-overtime perspective [4,6,7,16,22]. Our construction of optimal tolls is applicable to this model as well.…”