Global benefit of randomness in individual routing on transportation networks

Tak Shing TAI, Chi Ho YEUNG

Research output: Contribution to journalArticle

Abstract

By introducing a simple model based on two-dimensional cellular automata, we reveal the relationship between the routing strategies of individual vehicles and the global behavior of transportation networks. Specifically, we characterize the routing strategies by a single parameter called path-greediness, which corresponds to the tendency for individuals to travel via a shortest path to the destination. Remarkably, we found that the effective dimension of the system is reduced when the congested states emerge. We also found that a high individual tendency to travel via the shortest path does not necessarily shorten the average journey time, as the system may benefit from less greedy routing strategies in congested situations. Finally, we show that adaptive routing strategies outperform controlled strategies in the free-flow state but not in the congested state, implying that controlled strategies may increase coordination among vehicles and are beneficial for suppressing traffic congestion. Copyright © 2019 American Physical Society.
Original languageEnglish
Article number012311
JournalPhysical Review E
Volume100
Issue number1
DOIs
Publication statusPublished - Jul 2019

Fingerprint

transportation networks
Transportation Networks
Randomness
Routing
Shortest path
travel
vehicles
tendencies
Effective Dimension
Adaptive Routing
congestion
Traffic Congestion
free flow
cellular automata
Time-average
Cellular Automata
traffic
Strategy
Model-based
Path

Citation

Tai, T. S., & Yeung, C. H. (2019). Global benefit of randomness in individual routing on transportation networks. Physical Review E, 100(1). Retrieved from https://doi.org/10.1103/PhysRevE.100.012311

Keywords

  • PG student publication