Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Systems Engineering》 2006-08
Add to Favorite Get Latest Update

Sensitivity Analysis on the Minimum Saturated Flow of Blocking Networks

WU Wei-wei,NING Xuan-xi (College of Economics and Management,Nanjing University of Aeronautics and Astronautics,Nanjing 210016,China)  
In transport networks,especially in the case of emergency,the stochastic flow blocks network often at the(structural) blocking node.When the blockage is the most serious in the network,the saturated flow should be the minimum saturated flow.It is less than the maximum flow.The current saturated flow is just the practical flow capability of the network.If the maximum flow is regarded as the design flow capability in the network,the saturated flow often couldn't reach the maximum flow.To improve the blockage of the network,enlarging the capacities of some arcs is a directing idea.There existed some arcs in the network,adding their capacities couldn't improve the degree of blockage,even worse off.We first find the maximum blocking cut of the network,analyze the influence on the minimum saturated flow with changing the capacities of the arcs.The results show that adding capacities of the forward directed arcs could improve the degree of blockage,however,adding the capacities of the backward directed arcs couldn't improve the blockage of the network and sometimes lessen the minimum saturated flow.
【Fund】: 国家自然科学基金资助项目(70571037);; 南京航空航天大学博士学位论文创新与创优基金资助项目(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 1 Hits
1 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
【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 Algorithm for Solving Minimal Flow Problem of a Network[J];JOURNAL OF NANJING UNIVERSITY OF AERONAUTICS & ASTRONAUTICS;1997-05
4 WU Wei-wei,NING Xuan-xi(College of Economics and Management,Nanjing University of Aeronauticsand Astronautics,Nanjing 210016,China);Research of improving the blockage of emergency network[J];Journal of Systems Engineering;2006-03
5 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
【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 Ning Xuanxi;The Two -Way How -Augmenting Algorithm for Solving the Minimum Flow Problem of a Network[J];Systems Engineering;1997-01
3 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
4 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
5 CHEN Jing,SHAN Rui(School of Sciences,Yanshang University,Qinhuangdao 066004,China);Network maximal flow 2F algorithm with tolerance[J];Journal of Changchun University of Technology(Natural Science Edition);2008-06
6 LI Xin-hua1 ZHANG Zhao-ning2 HOU Rui1 1.Flight Service Center,Southwest Air Traffic Management Bureau of CAAC,Chengdu 610202,China 2.Air Traffic Management Department, Civil Aviation University of China,Tianjin 300300,China;Research of the Structural Stability of the Route Network System[J];Journal of Transportation Engineering and Information;2009-01
7 GUO Hong-yu;The evaluation of city road net transportation jam according to the fuzzy mathematics theory[J];Shanxi Architecture;2009-17
8 ZHANG Yuan-liang1,LU Peng2 (1.College of Traffic & Transportation,Southwest Jiaotong University,Chengdu 610031,China; 2.College of Mathematics,Southwest Jiaotong University,Chengdu 610031,China);Algorithm Research of Urban Traffic Congestion Early Warning Based on Rough Set Theory[J];Technology & Economy in Areas of Communications;2009-02
9 Ning Xuanxi Industry and Business College,Nanjing University of Aeronautics & Astronautics Nanjing,210016;Tower Graph——A Kind of Extended Hamiltonian Graph[J];Journal of Nanjing University of Aeronautics & Astronautics;2000-05
10 NING Xuan-xi, NING Angelika (College of Economics and Management, Nanjing University of Aeronautics & Astrounautics,Nanjing, 210016,China);Research on Knight′s Circuit Problem in Generalized Chessboards and Their Solutions[J];Journal of Nanjing University of Aeronautics & Astronautics;2004-03
【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 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
4 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
5 Yuan yahua, wang ziguo;Sensitivity of Flow Reliability[J];Systems Engineering;1993-02
6 Ning Xuanxi;A Branch -and -Bound Method for the Minimal Flow Problem of a Directed Network[J];Systems Engineering;1996-05
7 Ning Xuanxi;The Two -Way How -Augmenting Algorithm for Solving the Minimum Flow Problem of a Network[J];Systems Engineering;1997-01
8 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
9 WU Yun~(1,3),ZHOU Jian~2,YANG Yang~1(1. School of Management, Wuhan University of Technology,Wuhan 430077,China;2. Department of Computer Sciences , University of Angers,Angers France;3. School of Management , Huazhong Universtiy of Science and Technology,Wuhan 430077,China);A Chance-constrained Model and Intelligent Algorithm for Stochastic Network Bottleneck Capacity Expansion[J];Systems Engineering;2005-04
10 Li Dengfeng (Department of Applied Mathematics and System Engineering);Problems of Unbalanced Transportation with Fuzzy Constraints[J];Journal of National University of Defense Technology;1991-03
【Secondary Citations】
Chinese Journal Full-text Database 7 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 Ning Xuanxi Qian Lei Sun Yu College of Economics and Management,Nanjing University of Aeronautics & Astronautics Nanjing 210016,P.R.China;Research on Stochastic Flow in a Transportation Network by Simulational Method[J];Journal of Data Acquisition & Processing;2002-03
6 WU Wei-wei,NING Xuan-xi(College of Economics and Management,Nanjing University of Aeronautics and Astronautics,Nanjing Jiangsu 210016,China);Solve of the Minimum Saturated Flow in the Transportation Network[J];Mathematics in Practice and Theory;2006-09
7 WU Wei-wei,NING Xuan-xi(College of Economics and Management,Nanjing University of Aeronauticsand Astronautics,Nanjing 210016,China);Research of improving the blockage of emergency network[J];Journal of Systems Engineering;2006-03
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved