Collectively optimal routing for congested traffic limited by link capacity
Bogdan Danila, Yudong Sun, and Kevin E. Bassler

TL;DR
This paper demonstrates that optimizing route choices to minimize the maximum betweenness-to-capacity ratio in a city street network can significantly reduce congestion and travel times, especially when using a mix of link capacities.
Contribution
It introduces a method for collectively optimizing routing in complex networks by minimizing the maximum betweenness-to-capacity ratio, considering heterogeneous link capacities and loads.
Findings
Traffic congestion and travel times are significantly reduced.
Using slower, smaller capacity links can improve overall network performance.
Optimization is effective in heterogeneous networks.
Abstract
We show that the capacity of a complex network that models a city street grid to support congested traffic can be optimized by using routes that collectively minimize the maximum ratio of betweenness to capacity in any link. Networks with a heterogeneous distribution of link capacities and with a heterogeneous transport load are considered. We find that overall traffic congestion and average travel times can be significantly reduced by a judicious use of slower, smaller capacity links.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
