The Study on High Way Traffic Capacity Based on the Maximum-Flow Algorithm

Article Preview

Abstract:

The high way with its characteristics of high flow, fast, safe and comfortable, has played an important role in road traffic. In this paper, based on the maximum-flow algorithm, study on the traffic capacity of highway. Firstly, explain the basic theory of highway traffic capacity.Then, focusing on the method of maximum-flow algorithm to calculate the highway capacity, convert it into usable calculation mathematical model, explain the problem and cite an example.Finally,summarized the full text of the research work. The main research achievements and innovation in this paper is studying the highway network capacity from the macro level, use a quantitative study on the highway traffic capacity of the network.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

589-593

Citation:

Online since:

June 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Feirong Shi & Shaowei Yang & Jingliang Dai. 2007. Study of high way traffic capacity. Highway Traffic Science and Technology Press.

Google Scholar

[2] Kuangmin Chen & Baojie Yan. 2003. The analysis of highway capacity. China Communications Press. Beijing.

Google Scholar

[3] Wenjie Chen. 2003. Analysis of traffic capacity of city road network. Journal of Chinese People's Public Security University 9(2): 82-86.

Google Scholar

[4] Xiangyang Ku & Xiaoxia Luo. 2008. Points and edges with capacity constraints maximum flow algorithm in network. Computer application 28(1): 981-1001.

Google Scholar

[5] Yun Liu & Jiannong He. 2007. The improvement of shortest path search algorithm based on transportation network. Computer engineering and Applications 43(14): 220-222.

Google Scholar

[6] Yaping Zhang & Yulong Pei. 2002. The research status and development of road traffic capacity. Journal of traffic and Transportation Engineering 2(2): 94-97.

Google Scholar