Related papers: The Braess Paradox in Dynamic Traffic
To help mitigate road congestion caused by the unrelenting growth of traffic demand, many transportation authorities have implemented managed lane policies, which restrict certain freeway lanes to certain types of vehicles. It was…
Road congestion induces significant costs across the world, and road network disturbances, such as traffic accidents, can cause highly congested traffic patterns. If a planner had control over the routing of all vehicles in the network,…
This paper proposes a simplified version of classical models for urban transportation networks, and studies the problem of controlling intersections with the goal of optimizing network-wide congestion. Differently from traditional…
Every driver knows that severe weather conditions cause traffic congestions. In many cases there is no direct reason for the congestion, and people tend to attribute it to the slow driving mode. Our computational study shows that the slow…
For many power-limited networks, such as wireless sensor networks and mobile ad hoc networks, maximizing the network lifetime is the first concern in the related designing and maintaining activities. We study the network lifetime from the…
Traffic flow is a very prominent example of a driven non-equilibrium system. A characteristic phenomenon of traffic dynamics is the spontaneous and abrupt drop of the average velocity on a stretch of road leading to congestion. Such a…
This letter propose a new model for characterizing traffic dynamics in scale-free networks. With a replotted road map of cities with roads mapped to vertices and intersections to edges, and introducing the road capacity L and its handling…
In an Ideal Shortest Path Algorithm (ISPA), at each moment each router in a network sends all of its traffic down the path that will incur the lowest cost to that traffic. In the limit of an infinitesimally small amount of traffic for a…
We define a minimal model of traffic flows in complex networks containing the most relevant features of real routing schemes, i.e. a trade--off strategy between topological-based and traffic-based routing. The resulting collective behavior,…
Congestion and extreme events in transportation networks are emergent phenomena with significant socio-economic implications. In this work, we study congestion and extreme event properties on real urban street (planar) networks drawn from…
Many major cities suffer from severe traffic congestion. Road expansion in the cites is usually infeasible, and an alternative way to alleviate traffic congestion is to coordinate the route of vehicles. Various path selection and planning…
How do local topological changes affect the global operation and stability of complex supply networks? Studying supply networks on various levels of abstraction, we demonstrate that and how adding new links may not only promote but also…
Stochastic effects significantly influence the dynamics of traffic flows. Many dynamic traffic assignment (DTA) models attempt to capture these effects by prescribing a specific ratio that determines how flow splits across different routes…
It is known that connected and autonomous vehicles are capable of maintaining shorter headways and distances when they form platoons of vehicles. Thus, such technologies can result in increases in the capacities of traffic networks.…
Dynamic arrest is a general phenomenon across a wide range of dynamic systems, but the universality of dynamic arrest phenomena remains unclear. We relate the emergence of traffic jams in a simple traffic flow model to the dynamic slow down…
We introduce an optimum principle for a vehicular traffic network with road bottlenecks. This network breakdown minimization (BM) principle states that the network optimum is reached, when link flow rates are assigned in the network in such…
We present a phase diagram of the different kinds of congested traffic that are triggered by disturbances when passing ramps or other spatial inhomogeneities of a freeway. The simulation results obtained by the nonlocal, gas-kinetic-based…
We define and study an inference algorithm based on "belief propagation" (BP) and the Bethe approximation. The idea is to encode into a graph an a priori information composed of correlations or marginal probabilities of variables, and to…
Many networked applications, e.g., in the domain of cyber-physical systems, require strict service guarantees, usually in the form of jitter and latency bounds, for time-triggered traffic flows. It is a notoriously hard problem to compute a…
We study transportation networks controlled by dynamical feedback tolls. We consider a multiscale transportation network model whereby the dynamics of the traffic flows are intertwined with those of the drivers' route choices. The latter…