论文部分内容阅读
网络自动简化技术是分析流体网络的强有力工具,网络简化对提高流体网络算法的运行速度也具有重要意义。采用最长路径的思想限制算法的搜索范围,减少深度优先搜索算法搜索子网的次数,如果搜索的次数超过了源汇节点之间的搜索次数上限阈,那么就可以判定源汇节点之间不存在可以简化的子网。只需要通过正向搜索和反向搜索两次搜索过程即可确定需要简化的子网分支集合以及子网的类型,避免了纯粹数学计算方法的缺陷。同时采取“由内至外”的网络简化策略,从网络中层次间距最小的子网开始简化,将子网简化成1条分支,一层一层的向外进行简化,这样使得算法本身就具备了层次性,保证了最终网络简化结果的层次性。最后将简化算法进行应用并与文献提出的算法的简化结果进行了比较和分析。
Automatic network simplification technology is a powerful tool for analyzing fluid networks. Network simplification is also of great significance to improve the operation speed of fluid network algorithms. The idea of using the longest path limits the search range of the algorithm and reduces the number of sub-networks searched by the depth-first search algorithm. If the number of searches exceeds the upper limit of the number of search times between source nodes, it can be determined that the source node does not There is a subnet that can be simplified. It only needs to search the search process twice by forward search and reverse search to determine the set of sub-network branches and sub-networks that need to be simplified, which avoids the defects of the purely mathematical calculation method. At the same time to take “from the inside to the outside ” network simplification strategy, from the network in the smallest sub-layer spacing began to simplify, the subnet into a branch simplified, layer by layer outward simplification, making the algorithm itself It has the level, to ensure the final result of the network to simplify the level of. Finally, the simplified algorithm is applied and compared with the simplified results of the proposed algorithm.