Related papers: Network models for nonlocal traffic flow
The macroscopic traffic flow model is widely used for traffic control and management. To incorporate drivers' anticipative behaviors and to remove impractical speed discontinuity inherent in the classic Lighthill-Whitham-Richards (LWR)…
Modeling heterogeneous and multi-lane traffic flow is essential for understanding and controlling complex transportation systems. In this work, we consider three vehicle populations: two classes of human-driven vehicles (cars and trucks)…
We present a new family of second-order traffic flow models, extending the Aw-Rascle-Zhang (ARZ) model to incorporate nonlocal interactions. Our model includes a specific nonlocal Arrhenius-type look-ahead slowdown factor. We establish both…
We consider two variational models for transport networks, an urban planning and a branched transport model, in both of which there is a preference for networks that collect and transport lots of mass together rather than transporting all…
Traffic flows in a distributed computing network require both transmission and processing, and can be interdicted by removing either communication or computation resources. We study the robustness of a distributed computing network under…
We study a class of traffic flow models with nonlocal look-ahead interactions. The global regularity of solutions depend on the initial data. We obtain sharp critical threshold conditions that distinguish the initial data into a trichotomy:…
Based on the development in dealing with nonlocal boundary conditions, we propose a seamless local-nonlocal coupling diffusion model in this paper. In our model, a finite constant interaction horizon is equipped in the nonlocal part and…
We propose three models for the traffic of vehicles within a network formed by sites (cities, car-rental agencies, parking lots, etc.) and connected by two-way arteries (roads, highways), that allow forecasting the vehicular flux in a…
Recent literature has proved that stable dynamic routing algorithms have solid theoretical foundation that makes them suitable to be implemented in a real protocol, and used in practice in many different operational network contexts. Such…
We consider two different variational models of transport networks, the so-called branched transport problem and the urban planning problem. Based on a novel relation to Mumford-Shah image inpainting and techniques developed in that field,…
Recent results from statistical physics show that large classes of complex networks, both man-made and of natural origin, are characterized by high clustering properties yet strikingly short path lengths between pairs of nodes. This class…
We present analytical and numerical results of modeling of flows represented as the correlated non-Poissonian point process and as the Poissonian sequence of pulses of the different size. Both models may generate signals with the power-law…
We propose a model of random diffusion to investigate flow fluctuations in complex networks. We derive an analytical law showing that the dependence of fluctuations with the mean traffic in a network is ruled by the delicate interplay of…
This contribution summarizes and explains various principles from physics which are used for the simulation of traffic flows in large street networks, the modeling of destination, transport mode, and route choice, or the simulation of urban…
A recently introduced cellular automaton model for the description of traffic flow is investigated. It generalises asymmetric exclusion models which have attracted a lot of interest in the past. We calculate the so-called fundamental…
Many transport processes on networks depend crucially on the underlying network geometry, although the exact relationship between the structure of the network and the properties of transport processes remain elusive. In this paper we…
We study a class of dynamical multi-commodity flow networks in transportation networks. These are modeled as dynamical systems describing the evolution of the densities of a number of different commodities across the cells of a…
This work addresses the problem of evaluating optimal link capacities of a packet-flow network for the objective of congestion minimization. We present a simple model of packet flow in networks and present a numerical approach to evaluate…
We propose a new model of one-dimensional traffic flow using a coupled map lattice. In the model, each vehicle is assigned a map and changes its velocity according to it. A single map is designed so as to represent the motion of a vehicle…
Density fluctuations in traffic current are studied by computer simulations using the deterministic coupled map lattice model on a closed single-lane circuit. By calculating a power spectral density of temporal density fluctuations at a…