计算机工程与应用2016，Vol.52Issue(17)：24-28,5.DOI:10.3778/j.issn.1002-8331.1601-0044
物流运输网络连通可靠性分析的高效分解算法
Efficient decomposition algorithm for evaluating connectivity reliability of logistics trans-portation networks
摘要
Abstract
The network reliability analysis is one of the major methods to measure the service level of logistics transporta-tion networks. This paper proposes an efficient decomposition algorithm for evaluating the connectivity reliability of logis-tics transportation networks. The proposed algorithm makes full use of the relevant information obtained in the decomposi-tion process. By introducing three network reduction methods, series edges reduction, parallel edges reduction and sources combination, the proposed algorithm utilizes an effective decomposition technique to divide the set of state vectors, such that the space of network state vectors can be rapidly decomposed into subsets from which the connectivity reliability is readily and efficiently derived. Analyses of an example together with comparisons with the existing methods verify the performance and efficiency of the proposed algorithm.关键词
物流运输网络/连通可靠性/极小路/网络化简Key words
logistics transportation network/connectivity reliability/minimal path/network reduction分类
信息技术与安全科学引用本文复制引用
徐秀珍,曾旗..物流运输网络连通可靠性分析的高效分解算法[J].计算机工程与应用,2016,52(17):24-28,5.基金项目
国家自然科学基金（No.61300124，No.61403128）；河南省教育厅科技攻关计划（No.13B630034）；河南省教育厅基础研究计划（No.13B120022）；河南理工大学青年基金（No.Q2014-09）。 （）
