Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Data Acquisition & Processing》 2002-03
Add to Favorite Get Latest Update

Research on Stochastic Flow in a Transportation Network by Simulational Method

Ning Xuanxi Qian Lei Sun Yu College of Economics and Management,Nanjing University of Aeronautics & Astronautics Nanjing 210016,P.R.China  
Blockage is a kind of phenomenon, happened frequently in a transport network in which human beings are moving subjects. The blocking flow defined in this paper means the maximum flow through a network in the blocked situation of the network. The minimum flow means the maximum flow thourgh the network in the most seriously-blocked situation of the network. The research shows that it is difficult to determine the exact number of the minimum flow theoretionlly. So it is necessary to be proved by the simulational method. The blocking phenomenon and the flow regularity of blocking flow in a transportation network are studied by simulational model. The probability distributions of the different blocking flows are obtained and a new concept and the idex of the flow capacity in a network are presented. The validity of the algorithms is proved for solving the minimum flow problem.
【CateGory Index】: TP391.9
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 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
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 3 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
【Co-citations】
Chinese Journal Full-text Database 10 Hits
1 Ning Xuanxi;The Two -Way How -Augmenting Algorithm for Solving the Minimum Flow Problem of a Network[J];Systems Engineering;1997-01
2 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
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 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
5 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
6 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
7 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
8 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
9 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
10 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
【Co-references】
Chinese Journal Full-text Database 10 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 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
4 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
5 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
6 HU Jin-song,WU Fei,ZHONG Yong-guang(Department of Management Science and Engineering,Qindao University,Qingdao 266071,China);Study on Fuzzy Network Maximum Flow Algorithm[J];Mathematics in Practice and Theory;2006-08
7 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
8 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
9 YIXUN LIN ,XIANGLU LI,JUNQIANG DENG (Department of Mathematics, Zhengzhou University, Zhengzhou 450052);The Minimum Saturated Flow Problem in Emergency Networks[J];Or Transactions;2001-02
10 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
【Secondary References】
Chinese Journal Full-text Database 4 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 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 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
4 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 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 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
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved