位置:成果数据库 > 期刊 > 期刊详情页
A fast network partition method for large-scale urban traffic networks
  • ISSN号:1672-6340
  • 期刊名称:Journal of Control Theory and Applications
  • 时间:2013.8
  • 页码:359-366
  • 分类:TP[自动化与计算机技术]
  • 作者机构:[1]Department of Automation, Shanghai Jiao Tong University, and Key Laboratory of System Control and Information Processing, Ministry of Education
  • 相关基金:supported by the National Natural Science Foundation of China (Nos. 60934007, 61203169, 61104160); the China Postdoctoral Science Foundation (No. 2011M500776); the Shanghai Education Council Innovation Research Project (No. 12ZZ024); the International Cooperation Project of National Science Committee (No. 71361130012)
  • 相关项目:大规模城市交通路网的拥堵控制研究
中文摘要:

In order to control the large-scale urban traffic network through hierarchical or decentralized methods, it is necessary to exploit a network partition method, which should be both effective in extracting subnetworks and fast to compute. In this paper, a new approach to calculate the correlation degree, which determines the desire for interconnection between two adjacent intersections, is first proposed. It is used as a weight of a link in an urban traffic network, which considers both the physical characteristics and the dynamic traffic information of the link. Then, a fast network division approach by optimizing the modularity, which is a criterion to distinguish the quality of the partition results, is applied to identify the subnetworks for large-scale urban traffic networks. Finally, an application to a specified urban traffic network is investigated using the proposed algorithm. The results show that it is an effective and efficient method for partitioning urban traffic networks automatically in real world.

英文摘要:

In order to control the large-scale urban traffic network through hierarchical or decentralized methods, it is necessary to exploit a network partition method, which should be both effective in extracting subnetworks and fast to compute. In this paper, a new approach to calculate the correlation degree, which determines the desire for interconnection between two adjacent intersections, is first proposed. It is used as a weight of a link in an urban traffic network, which considers both the physical characteristics and the dynamic traffic information of the link. Then, a fast network division approach by optimizing the modularity, which is a criterion to distinguish the quality of the partition results, is applied to identify the subnetworks for large-scale urban traffic networks. Finally, an application to a specified urban traffic network is investigated using the proposed algorithm. The results show that it is an effective and efficient method for partitioning urban traffic networks automatically in real world.

同期刊论文项目
期刊论文 152 会议论文 106 获奖 24 专利 21 著作 2
同项目期刊论文