Computer Engineering and Applications ›› 2016, Vol. 52 ›› Issue (17): 24-28.

Previous Articles     Next Articles

Efficient decomposition algorithm for evaluating connectivity reliability of logistics transportation networks

XU Xiuzhen, ZENG Qi   

  1. School of Economics & Management, Henan Polytechnic University, Jiaozuo, Henan 454003, China
  • Online:2016-09-01 Published:2016-09-14

物流运输网络连通可靠性分析的高效分解算法

徐秀珍,曾  旗   

  1. 河南理工大学 经济管理学院,河南 焦作 454003

Abstract: The network reliability analysis is one of the major methods to measure the service level of logistics transportation networks. This paper proposes an efficient decomposition algorithm for evaluating the connectivity reliability of logistics transportation networks. The proposed algorithm makes full use of the relevant information obtained in the decomposition 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

摘要: 可靠性分析是衡量物流运输网络运行服务水平的主要手段之一。给出了一种评估物流运输网络连通可靠性的高效分解算法,算法充分利用分解过程中获得的相关信息,通过引入保持网络可靠性不变的串联边化简、并联边化简以及节点合并等规则,并结合向量集分解方法,能够快速实现对网络状态向量空间的分解,达到提高网络可靠性评估效率的目的。实例分析以及和现有方法的比较验证了算法的性能和分解效率。

关键词: 物流运输网络, 连通可靠性, 极小路, 网络化简