pith. sign in

arxiv: 0902.2415 · v2 · pith:KQZEWYWZnew · submitted 2009-02-14 · ⚛️ physics.soc-ph · cond-mat.dis-nn· cond-mat.stat-mech· cs.NI· physics.comp-ph

Collectively optimal routing for congested traffic limited by link capacity

classification ⚛️ physics.soc-ph cond-mat.dis-nncond-mat.stat-mechcs.NIphysics.comp-ph
keywords capacitylinktrafficcollectivelycongestedheterogeneousaveragebetweenness
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.