Taming macroscopic jamming in transportation networks

Ezaki, Takahiro; Nishi, Ryoichi; Nishinari, Katsuhiro

doi:10.1088/1742-5468/2015/06/p06013

Cited by 16 publications

(11 citation statements)

References 48 publications

(69 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some information systems, such as telecommunication [10] and computing networks [11,12], as well as trunked mobile radio systems and air traffic [13][14][15] are also amenable to the channel description.…”

Section: Introductionmentioning

confidence: 99%

Recurrence dynamics of particulate transport with reversible blockage: From a single channel to a bundle of coupled channels

et al. 2019

View full text Add to dashboard Cite

We model a particulate flow of constant velocity through confined geometries, ranging from a single channel to a bundle of Nc identical coupled channels, under conditions of reversible blockage. Quantities of interest include the exiting particle flux (or throughput) and the probability that the bundle is open. For a constant entering flux, the bundle evolves through a transient regime to a steady state. We present analytic solutions for the stationary properties of a single channel with capacity N ≤ 3 and for a bundle of channels each of capacity N = 1. For larger values of N and Nc, the system's steady state behavior is explored by numerical simulation. Depending on the deblocking time, the exiting flux either increases monotonically with intensity or displays a maximum at a finite intensity. For large N we observe an abrupt change from a state with few blockages to one in which the bundle is permanently blocked and the exiting flux is due entirely to the release of blocked particles. We also compare the relative efficiency of coupled and uncoupled bundles. For N = 1 the coupled system is always more efficient, but for N > 1 the behavior is more complex.

show abstract

Section: Introductionmentioning

confidence: 99%

Recurrence dynamics of particulate transport with reversible blockage: From a single channel to a bundle of coupled channels

et al. 2019

View full text Add to dashboard Cite

show abstract

“…, they found the system with 1 < p and 2 > p is stable for p <̄(= ( 1 + 2 )∕2) < 1∕2 . Therefore, MFD q D (̄) is continuous and given by Meanwhile, Ezaki and his coworkers extended the model to arbitrary strongly connected directed graphs [13,14]. Note that FD q( ) in their model is parabola like and symmetric, that is, p = 1∕2 .…”

Section: Previous Studiesmentioning

confidence: 99%

Macroscopic fundamental diagram in simple street networks

et al. 2019

View full text Add to dashboard Cite

Macroscopic fundamental diagrams (MFDs) on simple street networks are studied analytically and numerically. We consider nonlinear circuit model that consists of road elements with piecewise linear fundamental diagram. We find that MFDs of the model are discontinuous and sawtooth like. Meanwhile, simulations of optimal velocity model on the same street networks yield continuous MFDs, that are observed in real urban traffic.

show abstract

“…Such theoretical studies have elucidated the emergence mechanisms of congestion in computer networks (Ohira and Sawatari, 1998), road networks (Biham et al, 1992), airport networks (Ezaki and Nishinari, 2014), production networks (Ezaki, Yanagisawa and Nishinari, 2015), etc. Past studies have found critical determinants of transport performance, such as network topology (Guimerà et al, 2002;Zhao et al, 2005), capacity distribution (Zhao et al, 2005;Wu et al, 2008), routing algorithm (Echenique et al, 2004;Zhang et al, 2007;Ling et al, 2010;Ezaki, Nishi and Nishinari, 2015). These factors were taken into consideration in this study.…”

Section: Introductionmentioning

confidence: 97%

Towards understanding network topology and robustness of logistics systems

Ezaki¹,

Imura²,

Nishinari³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

The Physical Internet (PI) is a new paradigmatic concept for logistic systems, characterized by flexibility and efficiency through decentralization and standardization. In the PI, the delivery route of freight can be chosen flexibly from available paths at the moment, better utilizing transportation resources than traditional systems. However, the knowledge on the congestion dynamics of traffic in the PI is still limited. Here, to contribute to the understanding of the dynamical features of the PI, we examine the robustness of a network delivery system by using a simple model that extracts the essence of the problem. We performed extensive Monte Carlo simulations on various conditions on the type of algorithm, network structure, and transportation capacity, and three scenarios that mimic changes in demand: (i) locally and temporally increased traffic demand; (ii) globally and temporally increased traffic demand; and (iii) permanent change in demand pattern. We show that adaptive algorithms are more effective in networks that contain many bypass routes (e.g., the square lattice and random networks) rather than the hub-and-spoke networks. Furthermore, the square lattice and random networks were robust against the change in the demand pattern and temporal blockage (e.g., due to high demand) of delivery paths. We suggest that such preferable properties are in a trade-off relationship between the redundancy of networks and that the bypass structure is one of the important criteria for designing network logistics.

show abstract

Taming macroscopic jamming in transportation networks

Cited by 16 publications

References 48 publications

Recurrence dynamics of particulate transport with reversible blockage: From a single channel to a bundle of coupled channels

Recurrence dynamics of particulate transport with reversible blockage: From a single channel to a bundle of coupled channels

Macroscopic fundamental diagram in simple street networks

Towards understanding network topology and robustness of logistics systems

Contact Info

Product

Resources

About