Related papers: An easy-to-use algorithm for simulating traffic fl…
Robustness of routing policies for networks is a central problem which is gaining increased attention with a growing awareness to safeguard critical infrastructure networks against natural and man-induced disruptions. Routing under limited…
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or node failures, traffic bursts, and topology changes, and…
The nonlinear convection terms in the governing equations of compressible fluid flows are hyperbolic in nature and are nontrivial for modelling and numerical simulation. Many numerical methods have been developed in the last few decades for…
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…
Traffic prediction is a fundamental task in many real applications, which aims to predict the future traffic volume in any region of a city. In essence, traffic volume in a region is the aggregation of traffic flows from/to the region.…
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…
This paper offers a finite-state abstraction of traffic coordination and congestion in a network of interconnected roads (NOIR). By applying mass conservation, we model traffic coordination as a Markov process. Model Predictive Control…
We propose a model describing the traffic flow on a road with variable widths in this paper. The model, which is modified the Aw-Rascle model, is not conservative because of the source term. We obtain the elementary waves of the new traffic…
This work explores the capability of simulating complex fluid flows by directly solving the Boltzmann equation. Due to the high-dimensionality of the governing equation, the substantial computational cost of solving the Boltzmann equation…
We investigate dynamical properties of traffic flow using the stochastic car-following model with modified optimal velocity on circular road. The safety distance following the two-second rule and autonomous vehicles, acting as agents,…
Learning-based approaches are increasingly popular for traffic control problems. However, these approaches are applied typically as black boxes with limited theoretical guarantees and interpretability. In this paper, we consider the theory…
When optimizing transportation systems, anticipating traffic flows is a central element. Yet, computing such traffic equilibria remains computationally expensive. Against this background, we introduce a novel combinatorial optimization…
In the Optimal Velocity Model proposed as a new version of Car Following Model, it has been found that a congested flow is generated spontaneously from a homogeneous flow for a certain range of the traffic density. A well-established…
We propose a model to simulate different traffic-flow conditions in terms of quantum graphs hosting an (N+1)-level dot at each site. Our model allows us to keep track of the type and of the destination of each vehicle. The traffic flow…
Due to the complexity of the traffic flow dynamics in urban road networks, most quantitative descriptions of city traffic so far are based on computer simulations. This contribution pursues a macroscopic (fluid-dynamic) simulation approach,…
The knowledge of real-life traffic pattern is crucial for good understanding and analysis of transportation systems. This data is quite rare. In this paper we propose an algorithm for extracting both the real physical topology and the…
Transitions between two lanes often have a significant impact on various forms of road traffic. To address this problem, we have developed a two-lane asymmetric simple exclusion process model and two hypothetical traffic control strategies,…
Traditional network interdiction refers to the problem of an interdictor trying to reduce the throughput of network users by removing network edges. In this paper, we propose a new paradigm for network interdiction that models scenarios,…
This paper presents a Wasserstein attraction approach for solving dynamic mass transport problems over networks. In the transport problem over networks, we start with a distribution over the set of nodes that needs to be "transported" to a…
We consider the numerical approximation of compressible flow in a pipe network. Appropriate coupling conditions are formulated that allow us to derive a variational characterization of solutions and to prove global balance laws for the…