Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Mathematics in Practice and Theory》 2006-09
Add to Favorite Get Latest Update

Solve of the Minimum Saturated Flow in the Transportation Network

WU Wei-wei,NING Xuan-xi(College of Economics and Management,Nanjing University of Aeronautics and Astronautics,Nanjing Jiangsu 210016,China)  
In a transportation network,blockage is a kind of phenomenon commonly happened because of uncontrollable flow.The saturated flow of blocking network is less than the maximum flow.It is an important parameter in designing a transport network,especially an emergency evacuation network.Find the blocking section through the cutting-set matrix.An algorithm is proposed to solve the minimum saturated flow.An example is shown that this algorithm is simple and applicable.
【Fund】: 国家自然科学基金(70571037);; 南京航空航天大学2005年博士学位论文创新与创优基金(BCXJ05-08)
【CateGory Index】: O157.5
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
【References】
Chinese Journal Full-text Database 4 Hits
1 Wu Weiwei1,Ning Xuanxi2(1.College of Civil Aviation,Nanjing University of Aeronautics & Astronautics,Nanjing,210016,China;2.College of Economics and Management,Nanjing University of Aeronautics & Astronautics,Nanjing,210016,China);Minimum Saturated Flow Problem in Directed Network and Its Algorithm[J];Journal of Nanjing University of Aeronautics & Astronautics;2007-05
2 WU Wei-wei and NING Xuan-xi(College of Economics and Management,Nanjing University of Aeronautics and Astronautics,Nanjing 210016,Jiangsu,China);A Monte-Carlo simulation approach for stochastic flow of emergency evacuation networks based on different forward directed augmented paths[J];Journal of Shandong University(Natural Science);2006-06
3 XIE Fan-rong1,JIA Ren-an2(1.Department of Mathematics,Nanchang University,Nanchang 330031,China;2.Institute of System Engineering,Nanchang University,Nanchang 330031,China);Problem of Maximum Flow & Minimum Cut Set of Network with Lower & Upper Arc Capacities[J];Operations Research and Management Science;2008-02
4 WU Wei-wei,NING Xuan-xi(College of Economics and Management,Nanjing University of Aeronautics and Astronautics,Nanjing 210016,China);Simulation Research on Improving the Flow Capability of Emergency Networks[J];Chinese Journal of Management Science;2006-03
【Citations】
Chinese Journal Full-text Database 4 Hits
1 Ning Xuanxi;A Branch -and -Bound Method for the Minimal Flow Problem of a Directed Network[J];Systems Engineering;1996-05
2 Ning Xuanxi;The Two -Way How -Augmenting Algorithm for Solving the Minimum Flow Problem of a Network[J];Systems Engineering;1997-01
3 Ning Xuanxi (College of Industry and Business,NUAA Nanjing,210016);Graph Simplex Algorithm for Solving Minimal Flow Problem of a Network[J];JOURNAL OF NANJING UNIVERSITY OF AERONAUTICS & ASTRONAUTICS;1997-05
4 DANG Yao\|guo\+1, LIU Si\|feng\+1, FANG Zhi\|geng\+2(1. College of Economics and Management, Nanjing University of Aeronautics and Astronautics,Nanjing 210016, China; 2. Auto Management Institute, Bengbu 233000, China);Algorithm of Cutting-set Matrix on the Maximum Flows of Network[J];Systems Engineering-theory & Practice;2003-09
【Co-citations】
Chinese Journal Full-text Database 10 Hits
1 Northeast Forestry University Zhang Li Guan Qiang;Discussion about Fractal Dynamic Control of Blocks Stream on Urban Trunk Roads[J];Urban Public Transport;2007-03
2 GAO Jinbo, WUHaiyan, LENG Chuancai, ZHANG Rui(Beijing Institute of Civil Engineering and Architecture,Beijing 100044);Urban Road Network Capacity and Maximum Flow Algorithm Improvement[J];Road Traffic & Safety;2006-01
3 ZHANG Jing~(1),QIU Xue-shao~(2)(1.Software Institute,Tongji University,Shanghai 201800,China;2.Department of Information and Computation Science.,Zhengzhou Institute of Light Industry,Zhengzhou 450002,China);Algorithm and Its Implementation for the Network Maximal Flow[J];Journal of Chongqing University(Natural Science Edition);2006-05
4 Ning Xuanxi;The Two -Way How -Augmenting Algorithm for Solving the Minimum Flow Problem of a Network[J];Systems Engineering;1997-01
5 WU Wei-wei,NING Xuan-xi (College of Economics and Management,Nanjing University of Aeronautics and Astronautics,Nanjing 210016,China);Sensitivity Analysis on the Minimum Saturated Flow of Blocking Networks[J];Systems Engineering;2006-08
6 WANG Ji(Wuhan Science Technology University,Wuhan,Hubei,430070);A Solution of the Fuzzy Network Minimal Flow Problem[J];Journal of Guangdong Radio & Television University;2006-04
7 Hai Jun, Hou Yuanda(The Military Traffic Academy,Tianjin 300161,China);Study of the Maximal-Capacity-Path Algorithm of the Dynamic Traffic Network[J];Traffic Engineering and Technology for National Defence;2008-02
8 SUN Ze-yu(Computer and Information Engineering Department Luoyang Institute of Science and Technology,Luoyang 471023,China);Research in the Algorithm on the Solution to the Maximum Network Flow Problem Base on Mark[J];Journal of Gansu Lianhe University(Natural Science Edition);2009-04
9 HAN Gai-yana,XU Long-fengb (Anhui University of Technology a.School of Electrical Engineering & Information;b.School of Mathematics & Physics,Ma'anshan 243002,China);Paradox Phenomena of the Traffic Network Design Problem Based on Minimum Flow[J];Journal of Anhui University of Technology(Natural Science);2008-01
10 LIU Jian-mei1,2,MA Shou-feng1,HE Zheng-bing1,JIA Ning1 1.Institute of Systems Engineering,Tianjin University,Tianjin 300072,China;2.Department of Mathematics,Jining College,Jining 272000,China;Recognition method for congestion state of road network about coordination of traffic control and guidance[J];Journal of Management Sciences in China;2010-11
China Proceedings of conference Full-text Database 2 Hits
1 Weiwei Wu, Xuanxi Ning College of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China;How to Improve the Flow Capability of Transport networks[A];[C];2006
2 ;城市交通控制与诱导协调中若干问题的研究[A];[C];2009
【Co-references】
Chinese Journal Full-text Database 10 Hits
1 WANG Fang,HOU Chao-zhen(Department of Automatic Control, School of Information Science and Technology, Beijing Institute of Technology, Beijing100081, China);Evaluation of the Reliability of Stochastic Flow Network Using Monte Carlo Method and the Petri Net[J];Journal of Beijing Institute of Technology;2004-07
2 WANG Fang, HOU Chao-zhen (School of Information Science and Technology, Beijing Institute of Technology, Beijing100081, China);New Algorithm to Evaluate the Unreliability of Flow Networks Based on Minimal Cutsets[J];北京理工大学学报(英文版);2004-01
3 Tang Kun (Glorious Sun School of Business and Management, Dong Hua University, Shanghai, 200051);Genetic Algorithm Design and Application on Vehicle Routing Problem[J];Journal of Donghua University,Natural Science;2002-01
4 FAN Jinwei~1 LU Kang~2 (1.Zhengzhou Commercial Trade Technician Institute,ZhengZhou 450066;2.Henan Institute of Education,ZhengZhou 450046);Study on the Dijkstra Algorithm Applicated in Logistics Distribution[J];Computer Programming Skills & Maintenance;2009-04
5 Liu Xihui Wang Wang Haiyan Zhang Rui (Computer Science Center, Institute of Electronics Industry. Beijing);FUZZY SEISMIC RELIABILITY OF WATER SUPPLY PIPELINE BY EMPLOYING MONTE CARLO SIMULATION[J];Journal of Seismological Research;1989-03
6 ZHONG Wei,YIN Zhi wen,LOU Na (School of Management Fudan University,Shanghai 200433,China);A New Optimizing Algorithm for the Time-Cost Project Network[J];Journal of Fudan University;2001-04
7 Yuan yahua, wang ziguo;Sensitivity of Flow Reliability[J];Systems Engineering;1993-02
8 Ning Xuanxi;A Branch -and -Bound Method for the Minimal Flow Problem of a Directed Network[J];Systems Engineering;1996-05
9 Ning Xuanxi;The Two -Way How -Augmenting Algorithm for Solving the Minimum Flow Problem of a Network[J];Systems Engineering;1997-01
10 JIA Chun-yu~1,HU Ruo-fei~1,HONG Qi~2 (1. School of Management,Changchun University, Changchun 130022,China; 2. Department of Fundamental,Shenzhen Vocational and Technological College,Shenzhen 518029, China);A Simple Method of Transportation Problems with Time Restraint[J];Systems Engineering;2004-08
【Secondary References】
Chinese Journal Full-text Database 5 Hits
1 WU Wei-wei,NING Xuan-xi (College of Economics and Management,Nanjing University of Aeronautics and Astronautics,Nanjing 210016,China);Sensitivity Analysis on the Minimum Saturated Flow of Blocking Networks[J];Systems Engineering;2006-08
2 PANG Mingbao,DONG Fang,REN Shasha(School of Civil Engineering,Hebei University of Technology,Tianjin 300401,China);Study on Emergency Evacuation Routes of Urban Traffic Based on Time Dependent Network[J];Journal of Highway and Transportation Research and Development;2011-01
3 WU Wei-wei and NING Xuan-xi(College of Economics and Management,Nanjing University of Aeronautics and Astronautics,Nanjing 210016,Jiangsu,China);A Monte-Carlo simulation approach for stochastic flow of emergency evacuation networks based on different forward directed augmented paths[J];Journal of Shandong University(Natural Science);2006-06
4 WU Wei-wei~1,NING Xuan-xi~2 (1.Civil Aviation College,Nanjing University of Aeronautics and Astronautics,Nanjing 210016,China;2.College of Economics and Management,Nanjing University of Aeronautics and Astronautics,Nanjing 210016,China);Evaluation of the reconstructing scheme making streets one-way[J];Systems Engineering-Theory & Practice;2009-07
5 WU Wei-wei1,NING Xuan-xi2(1.Civil Aviation Coll.,Nanjing Univ.of Aeronautics and Astronautics,Nanjing 210016,China;2.Coll.of Economics and Management,Nanjing Univ.of Aeronautics and Astronautics,Nanjing 210016,China);Evaluation of the reliability of stochastic moving networks based on the blocking cutset[J];Systems Engineering and Electronics;2007-11
【Secondary Citations】
Chinese Journal Full-text Database 5 Hits
1 Ning Xuanxi;A Branch -and -Bound Method for the Minimal Flow Problem of a Directed Network[J];Systems Engineering;1996-05
2 Ning Xuanxi;The Two -Way How -Augmenting Algorithm for Solving the Minimum Flow Problem of a Network[J];Systems Engineering;1997-01
3 Ning Xuanxi (College of Industry and Business, NUAA Nanjing,210016);Graph Simplex Method for Solution of Maximum Flow Problem in a Network[J];TRANSACTIONS OF NANJING UNIVERSITY OF AERONAUTICS & ASTRONAUTICS;1996-05
4 Ning Xuanxi (College of Industry and Business,NUAA Nanjing,210016);Graph Simplex Algorithm for Solving Minimal Flow Problem of a Network[J];JOURNAL OF NANJING UNIVERSITY OF AERONAUTICS & ASTRONAUTICS;1997-05
5 ZOU Hao si 1,WANG Yuan zhi 2 (1.Technical & Vocational Institute,NeiMongol University,Hohhot 010020,PRC; 2.Baotou University of Iron and Steel Technology,Baotou 014010,PRC);Matrix Algorithm of Maximal Flow[J];Acta Scientiarum Naturalium Universitatis Neimongol;2001-04
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved