Related papers: A dynamic model of congestion
Modeling networks as different graph types and researching on route finding strategies, to avoid congestion in dense subnetworks via graph-theoretic approaches, contributes to overall blocking probability reduction in networks. Our main…
Motivated by microscopic traffic modeling, we analyze dynamical systems which have a piecewise linear concave dynamics not necessarily monotonic. We introduce a deterministic Petri net extension where edges may have negative weights. The…
In this work, we introduce a novel first-order nonlocal partial differential equation with saturated diffusion to describe the macroscopic behavior of traffic dynamics. We show how the proposed model is better in comparison with existing…
The central points of communication network flow has often been identified using graph theoretical centrality measures. In real networks, the state of traffic density arises from an interplay between the dynamics of the flow and the…
To tackle ever-increasing city traffic congestion problems, researchers have proposed deep learning models to aid decision-makers in the traffic control domain. Although the proposed models have been remarkably improved in recent years,…
We compare the point-wise and segment-wise descriptions of the traffic system. Using real data from the Taiwan highway system with a tremendous volume of segment-wise data, we find that the segment-wise description is much more informative…
Based on experimental traffic data obtained from German and US highways, we propose a novel two-dimensional first-order macroscopic traffic flow model. The goal is to reproduce a detailed description of traffic dynamics for the real road…
We prove discrete-to-continuum convergence for dynamical optimal transport on $\mathbb{Z}^d$-periodic graphs with energy density having linear growth at infinity. This result provides an answer to a problem left open by Gladbach, Kopfer,…
While many classical traffic models treat the spatial extension of streets continuously or by discretization into cells of a certain length, we will subdivide roads into comparatively long homogeneous road sections of constant capacity with…
It is understood that congestion in traffic can be interpreted in terms of the instability of the equation of dynamic motion. The evolution of a traffic system from an unstable or metastable state to a globally stable state bears a strong…
We introduce a cellular automaton model coupled with a transport equation for flows on graphs. The direction of the flow is described by a switching process where the switching probability dynamically changes according to the value of the…
In this paper, urban traffic is modeled using dual graph representation of urban transportation network where roads are mapped to nodes and intersections are mapped to links. The proposed model considers both the navigation of vehicles on…
An universal primal-dual approach of description equilibriums in large class of hierarchical congestion population games is proposed. At the very core of the approach is hierarchy of enclosed to each other transport networks. In different…
Recent studies on transportation networks have shown that real-time route guidance can inadvertently induce congestion or oscillatory traffic patterns. Nevertheless, such technologies also offer a promising opportunity to manage traffic…
We consider a class of convex optimization problems modelling temporal mass transport and mass change between two given mass distributions (the so-called dynamic formulation of unbalanced transport), where we focus on those models for which…
We study traffic flow on roads with a localized periodic inhomogeneity such as traffic signals, using a stochastic car-following model. We find that in cases of congestion, traffic flow can be optimized by controlling the inhomogeneity's…
We introduce a class of partial differential equations on metric graphs associated with mixed evolution: on some edges we consider diffusion processes, on other ones transport phenomena. This yields a system of equations with possibly…
Here we present the entropic dynamics formalism for networks. That is, a framework for the dynamics of graphs meant to represent a network derived from the principle of maximum entropy and the rate of transition is obtained taking into…
We develop a discrete Boltzmann-type model that uses dynamics in phase space to describe the behavior of traffic flows. Firstly, we model the traffic flow at mesoscopic scale using dynamics in phase space, which is considered as an…
The simulation of traffic flow on networks requires knowledge on the behavior across traffic intersections. For macroscopic models based on hyperbolic conservation laws there exist nowadays many ad-hoc models describing this behavior. Based…