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.
CitationTai, 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
- PG student publication