Improved arithmetic about the maximum flow in road network using auxiliary graph theory - 文章详情页

作者：

Li, P.-S. (Li, P.-S..) | Li, B. (Li, B..) | Xie, X.-L. (Xie, X.-L..) | Wang, M. (Wang, M..) (学者：王民)

收录：

Scopus CSCD

摘要：

In　road　network　planning,　locating　the　key　sections　is　very　useful　to　solve　the　traffic　bottleneck.　Locating　the　key　sections　is　equal　to　finding　the　maximum　flow.　To　begin　with,　this　paper　analyzed　and　compared　kinds　of　methods　solving　the　network　maximum　flow　problem.　Secondly,　this　paper　pointed　out　a　convenient　method　based　on　the　auxiliary　graph　theory　and　Dijkstra　method.　That　is　to　say,　the　method　could　be　used　to　get　the　minimum　cutset　and　the　maximum　flow　using　the　shortest　path　algorithm,　and　the　VC　+　+　program　was　also　used.　Finally,　based　on　the　road　network　of　Tianjin,　an　example　was　given　for　further　explanation.　Through　comparison,　it　can　be　found　that　it　is　a　convenient　method　to　locate　the　key　sections,　and　can　support　the　transportation　planning　and　management　with　theoretical　basis　and　data.

关键词：

Auxiliary graph; Key section; Network capacity; Shortest path algorithm

作者机构：

[ 1 ] [Li, P.-S.]Transportation College of Southeast University, Nanjing 210096, China
[ 2 ] [Li, P.-S.]National Intelligent Transport Systems Center of Engineering and Technology, Beijing 100088, China
[ 3 ] [Li, B.]National Intelligent Transport Systems Center of Engineering and Technology, Beijing 100088, China
[ 4 ] [Xie, X.-L.]Beijing University of Technology, Beijing 100022, China
[ 5 ] [Wang, M.]National Intelligent Transport Systems Center of Engineering and Technology, Beijing 100088, China

通讯作者信息：

[Li, B.]National Intelligent Transport Systems Center of Engineering and Technology, Beijing 100088, China

电子邮件地址：

libin@itsc.com.cn

查看成果更多字段

成果类型
所属机构

所有年份指定年份从至