arXiv 0902.24152009-02physics.soc-phcond-mat.dis-nncond-mat.stat-mechcs.NIphysics.comp-ph

Collectively optimal routing for congested traffic limited by link capacity

Bogdan Danila, Yudong Sun, Kevin E. Bassler

备注：: 7 pages, 4 figures
发表信息：: Phys Rev E 80 (6) 066116, 2009
DOI：: 10.1103/PhysRevE.80.066116

英文摘要：

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.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

The global benefit of randomness in individual routing on transportation networks

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, when vehicles tend to travel via the shortest path, a congested-flow state emerges between the conventional free-flow and congested states, where traffic flow increases slowly with v…

2019-03-05cond-mat.stat-mechmath.PRnlin.CG

Dynamic origin-to-destination routing of wirelessly connected, autonomous vehicles on a congested network

Up-to-date information wirelessly communicated among vehicles can be used to select the optimal route between a given origin and destination. To elucidate how to make use of such information, simulations are performed for autonomous vehicles traveling on a square lattice of roads. All the possible routes between the origin and the destination (without backtracking) are of the same length. Congestion is the only determinant of delay. At each intersection, right-of-way is given to the closest vehicle. There are no traffic lights. Trip times of a subject vehicle are recorded for various initial c…

2016-11-30physics.soc-ph

Multi-objective Eco-Routing Model Development and Evaluation for Battery Electric Vehicles

This paper develops and investigates the impacts of multi-objective Nash optimum (user equilibrium) traffic assignment on a large-scale network for battery electric vehicles (BEVs) and internal combustion engine vehicles (ICEVs) in a microscopic traffic simulation environment. Eco-routing is a technique that finds the most energy efficient route. ICEV and BEV energy consumption patterns are significantly different with regard to their sensitivity to driving cycles. Unlike ICEVs, BEVs are more energy efficient on low-speed arterial trips compared to highway trips. Different energy consumption p…

2020-08-10cs.MAcs.SYeess.SY

Impact of Distributed Routing of Intelligent Vehicles on Urban Traffic

The impact of distributed dynamic routing with different market penetration rates (MPRs) of connected autonomous vehicles (CAVs) and congestion levels has been investigated on urban streets. Downtown Toronto network is studied in an agent-based traffic simulation. The higher the MPRs of CAVs--especially in the case of highly congested urban networks--the higher the average speed, the lower the mean travel time, and the higher the throughput.

2018-09-16physics.soc-ph

Study of dynamic and static routing for improvement of the transportation efficiency on small complex networks

In this paper, we are exploring strategies for the reduction of the congestion in the complex networks. The nodes without buffers are considered, so, if the congestion occurs, the information packets will be dropped. The focus is on the efficient routing. The routing strategies are compared using two generic models, i.e., Barabàsi-Albert scale-free network and scale-free network on lattice, and the academic router networks of the Netherlands and France. We propose a dynamic deflection routing algorithm which automatically extends path of the packet before it arrives at congested node. The simu…

2013-01-16cs.NIcs.SIphysics.soc-ph

Congestion phenomena on complex networks

We define a minimal model of traffic flows in complex networks containing the most relevant features of real routing schemes, i.e. a trade--off strategy between topological-based and traffic-based routing. The resulting collective behavior, obtained analytically for the ensemble of uncorrelated networks, is physically very rich and reproduces results recently observed in traffic simulations on scale-free networks. We find that traffic control is useless in homogeneous graphs but may improves global performance in inhomogeneous networks, enlarging the free-flow region in parameter space. Traffi…

2008-08-05cs.NIphysics.soc-ph

更多相关论文收起更多论文

城市街道网络中的拥堵与极端事件

Congestion and extreme events in urban street networks

本研究针对四座城市的真实街道网络与规则方格网，结合三种带现实交通特征的随机游走模型，分析拥堵相变与极端事件特性，发现交通感知路由无法完全消弭拥堵，且两类网络在相关特性上表现相似。

2025-05-21cond-mat.dis-nnphysics.data-anphysics.soc-ph

Enhancing Transport Efficiency by Hybrid Routing Strategy

Traffic is essential for many dynamic processes on real networks, such as internet and urban traffic systems. The transport efficiency of the traffic system can be improved by taking full advantage of the resources in the system. In this paper, we propose a dual-strategy routing model for network traffic system, to realize the plenary utility of the whole network. The packets are delivered according to different "efficient routing strategies" [Yan, et al, Phys. Rev. E 73, 046108 (2006)]. We introduce the accumulate rate of packets, η to measure the performance of traffic system in the congeste…

2012-04-15nlin.AOphysics.soc-ph

Scaling behavior of an artificial traffic model on scale-free networks

In this article, we investigate an artificial traffic model on scale-free networks. Instead of using the routing strategy of the shortest path, a generalized routing algorithm is introduced to improve the transportation throughput, which is measured by the value of the critical point disjoining the free-flow phase and the congested phase. By using the detrended fluctuation analysis, we found that the traffic rate fluctuation near the critical point exhibits the $1/f$-type scaling in the power spectrum. The simulation results agree very well with the empirical data, thus the present model may c…

2006-08-31physics.data-anphysics.soc-ph

Multicommodity routing optimization for engineering networks

Optimizing passengers routes is crucial to design efficient transportation networks. Recent results show that optimal transport provides an efficient alternative to standard optimization methods. However, it is not yet clear if this formalism has empirical validity on engineering networks. We address this issue by considering different response functions -- quantities determining the interaction between passengers -- in the dynamics implementing the optimal transport formulation. Particularly, we couple passengers' fluxes by taking their sum or the sum of their squares. The first choice natura…

2022-05-04math.DSphysics.app-phphysics.soc-ph

Congestion diffusion and decongestion strategy in networked traffic

We study the information traffic in Barabási-Albert scale free networks wherein each node has finite queue length to store the packets. It is found that in the case of shortest path routing strategy the networks undergo a first order phase transition i.e., from a free flow state to full congestion sate, with the increasing of the packet generation rate. We also incorporate random effect (namely random selection of a neighbor to deliver packets) as well as a control method (namely the packet-dropping strategy of the congested nodes after some delay time $T$) into the routing protocol to test th…

2007-11-11physics.soc-ph

Coordination Group Formation for OnLine Coordinated Routing Mechanisms

University of Florida（佛罗里达大学）

This study considers that the collective route choices of travelers en route represent a resolution of their competition on network routes. Well understanding this competition and coordinating their route choices help mitigate urban traffic congestion. Even though existing studies have developed such mechanisms (e.g., the CRM [1]), we still lack the quantitative method to evaluate the coordination penitential and identify proper coordination groups (CG) to implement the CRM. Thus, they hit prohibitive computing difficulty when implemented with many opt-in travelers. Motived by this view, this …

2019-11-12cs.LGphysics.soc-phstat.ML