Paper Info
Title
Improving The Throughput Of Transportation Networks With A Time-Optimization Routing Strategy
Abstract
Traffic congestion, a common and complicated phenomenon in urban transportation systems, is attracting increasing attention from researchers in Geographical Information Science (GIS) and other fields. In this study, we illustrate a general mechanism that reveals the relationship between travel time and dynamic traffic conditions. We measure a vehicle's travel time to its destination along any path, where the travel time is calculated based on the path length and on the real-time traffic volume and transport capacity of each road segment on the path. On the basis of this measurement, we present a simple dynamic routing strategy that allows each vehicle to dynamically choose the path to its destination while imposing the minimum travel time. The application of our routing algorithm to the Chengdu street network, Barabasi-Albert scale-free network and Erdos-Renyi random network shows that the proposed strategy remarkably improves network throughput and balances traffic load distribution. Our findings suggest that mining the time mechanism of network transport is important to explore efficient time-optimization routing algorithms to enhance the transport capacity of urban street networks and other kinds of networks.
Year
DOI
Venue
2018
10.1080/13658816.2018.1487561
INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE
Keywords
Field
DocType
Traffic flow, routing algorithm, travel time, network throughput, GIS
Geographic information system,Data mining,Traffic flow,Random graph,Street network,Path length,Computer science,Computer network,Throughput,Travel time,Routing algorithm
Journal
Volume
Issue
ISSN
32
9
1365-8816
Citations 
PageRank 
References 
0
0.34
19
Authors
8
Name
Order
Citations
PageRank
Gang Liu101.01
Wen Long200.68
Jingchao Wang300.34
Peichao Gao475.98
Jing He59314.67
Zhiyong Luo600.34
Lian Li718940.80
Yongshu Li832.52