Traffic gridlock on complex networks

Mendes, G. A.; Silva, L.R. da; Herrmann, Hans J.

doi:10.1016/j.physa.2011.07.046

Cited by 57 publications

(24 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It mainly considers the Swiss road network and different boundary conditions. In any case, this is certainly the first study to use real network data in the framework of Mendes' approach [29].…”

Section: Introductionmentioning

confidence: 95%

“…To do it, we will use the model introduced by mendes et al [29] which is based on the conservation of the number of vehicles and provides an easy and fast way to monitor the formation of traffic jams and flux in large road networks. The parameters which were taken account to simulate the scenario of disaster are: the maximum allowed speed, the length, the capacity and the position of each road.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A scenario planning approach for disasters on Swiss road network

Mendes¹,

Axhausen

Andrade³

et al. 2014

Int. J. Mod. Phys. C

View full text Add to dashboard Cite

We study a vehicular traffic scenario on Swiss roads in an emergency situation, calculating how sequentially roads block due to excessive traffic load until global collapse (gridlock) occurs and in this way displays the fragilities of the system. We used a database from Bundesamt für Raumentwicklung which contains length and maximum allowed speed of all roads in Switzerland. The present work could be interesting for government agencies in planning and managing for emergency logistics for a country or a big city. The model used to generate the flux on the Swiss road network was proposed by Mendes et al. [Physica A 391, 362 (2012)]. It is based on the conservation of the number of vehicles and allows for an easy and fast way to follow the formation of traffic jams in large systems. We also analyze the difference between a nonlinear and a linear model and the distribution of fluxes on the Swiss road.

show abstract

Section: Introductionmentioning

confidence: 95%

Section: Introductionmentioning

confidence: 99%

A scenario planning approach for disasters on Swiss road network

Mendes¹,

Axhausen

Andrade³

et al. 2014

Int. J. Mod. Phys. C

View full text Add to dashboard Cite

show abstract

“…For example, some important dynamical processes on the basis of Apollonian models [14], a kind of deterministic graphs of scale-free, small-world, Euclidean, space-filling and matching graphs, are researched densely. The accurate analytical solutions are derived, including percolation [15], electrical conduction [14], Ising models [14], quantum transport [16], partially connected feedforward neural networks [17], traffic gridlock [18], Bose-Einstein condensation [19], Free-electron gas [20], and so on. However, the physical processes on FG are still lacking, for the recursive relationship in FG are more complex than Apollonian networks.…”

Section: Introductionmentioning

confidence: 99%

Vertex Labeling and Routing for Farey-Type Symmetrically-Structured Graphs

Jiang¹,

Zhai²,

Zhuang³

et al. 2018

Preprint

View full text Add to dashboard Cite

Abstract:The generalization of Farey graphs and extended Farey graphs are all originated from Farey graph and scale-free and small-world simultaneously. We propose a labeling of the vertices for it that allows determining all the shortest paths routing between any two vertices only based on their labels. The maximum number of shortest paths between any two vertices is huge as the product of two Fibonacci numbers, however, the label-based routing algorithm runs in linear time O(n). The existence of an efficient routing protocol for Farey-type models should help the understanding of several physical dynamic processes on it.

show abstract

“…Recent advances in studies of complex networks motivated the researches on the features and dynamics of scale-free communication networks. [5][6][7][8][9][10][11] With the increasing demand for transmitting big data, congestion becomes a considerable challenge in many real communication systems. It will be di±cult to recover large systems from congested state to free-°ow state.…”

Section: Introductionmentioning

confidence: 99%

Effective hybrid link-adding strategy to enhance network transport efficiency for scale-free networks

Bai

Liu

Zhang

2017

Int. J. Mod. Phys. C

View full text Add to dashboard Cite

In this paper, we propose a new strategy (HLS) to enhance the transport capacity of scale-free networks by adding links to the existing networks, based on the betweenness of nodes, the shortest path length and the betweenness of links. Since only slight amounts of nodes in scalefree networks have high betweenness centrality, local link-adding strategy is adopted as a part of HLS for target nodes, which can signi¯cantly reduce the load of target nodes. Moreover, in order to improve the robustness of our strategy under some extreme cases, second sorting procedure is introduced in HLS. Simulation results show that HLS outperforms the IE strategy in terms of transport capacity and delivering ability of scale-free networks. After the adding links process of HLS, the congestion can be alleviated e±ciently, which is meaningful to the realistic networks.

show abstract

Traffic gridlock on complex networks

Cited by 57 publications

References 34 publications

A scenario planning approach for disasters on Swiss road network

A scenario planning approach for disasters on Swiss road network

Vertex Labeling and Routing for Farey-Type Symmetrically-Structured Graphs

Effective hybrid link-adding strategy to enhance network transport efficiency for scale-free networks

Contact Info

Product

Resources

About