Xiu-Zhen Xu

Xiu-Zhen Xu

Auto-generated profile, based on publicly available information

Xiu-Zhen Xu

School of Modern Posts, Chongqing University of Posts and Telecommunications, Chongqing, China

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 September 2019 in IEEE Transactions on Reliability
Verified
Journal Article
Closed access
YNYi-Feng Niu
Yi-Feng Niu
XXXiu-Zhen Xu
Xiu-Zhen Xu
Reliability evaluation is a useful tool for network performance demonstration, and therefore has become an increasingly relevant task in network design and operation. The multistate minimal cut (called d-MC for short) method is a popular algorithm for reliability evaluation of multistate flow networks. This article focuses on d-MC problem, and presents some new results to improve its solution. Grounded on the newly obtained results, an algorithm is proposed to find d-MCs, together with discussions on its time complexity that compares favorably with the existing methods. An illustration of the presented algorithm is provided by solving a simple example. Furthermore, numerical experiments and a case study are conducted to demonstrate the advantage and the utility of the proposed algorithm, respectively.

1 January 2019 in Complexity
Verified
Journal Article
Open access
PDF file
XXXiu-Zhen Xu
Xiu-Zhen Xu
YNYi-Feng Niu
Yi-Feng Niu
QLQing LI
Qing LI
A number of real‐world complex networks can be modeled as multistate networks for performance analysis. A multistate network consists of multistate components and possesses multiple different performance levels. For such a network, reliability is concerned with the probability of the network capacity level greater than or equal to a predetermined demand level d. One major method for multistate network reliability evaluation is using d‐minimal paths. This paper proposes an efficient algorithm to find d‐minimal paths. First, a new concept of qualified state vector is defined so as to fix a relatively smaller search space of d‐minimal paths, and a sufficient and necessary condition for a qualified state vector to be d‐minimal path is established. Then, the max‐flow algorithm and the enumeration algorithm are integrated to search for d‐minimal paths in the determined search space that is recursively divided into subspaces such that the searching efficiency can be increased as much as possible. Both analytical and numerical results show that the proposed algorithm is more efficient in finding all d‐minimal paths. In addition, a case study related to power transmission network is performed to demonstrate the implication of network reliability.

1 January 2018 in Complexity
Verified
Journal Article
Open access
PDF file
XXXiu-Zhen Xu
Xiu-Zhen Xu
YNYi-Feng Niu
Yi-Feng Niu
QLQing Li
Qing Li
This paper focuses on performance assessment of a freight network with stochastic capacities by using reliability analysis, in which a node denotes a supplier, a transfer center, a distribution center, or a market, while an arc denotes a logistics service provider offering the freight traffic service for a pair of nodes. Due to some uncertainties in real environment (for example, a proportion of vehicles owned by the provider may be reserved by other customers), the available capacity of the provider along each arc is stochastic. Thus, network reliability that at least d units of commodity demand can be successfully delivered from the source to the destination denotes the operational performance of such a freight network. A d‐minimal path–based method is developed to evaluate the freight network reliability. To advance the efficiency of solving d‐minimal paths, an improved model is established by redefining capacity bounds of arcs and minimal paths. Furthermore, a new concept of expected capacity grounded on network reliability is presented to measure the service performance of the freight network. A practical case related to the coal delivery network is studied to demonstrate the implications of both network reliability and expected capacity.

22 October 2020 in Complexity
Verified
Journal Article
Open access
PDF file
XXXiu-Zhen Xu
Xiu-Zhen Xu
YNYi-Feng Niu
Yi-Feng Niu
CHCan He
Can He
Most of modern technological networks that can perform their tasks with various distinctive levels of efficiency are multistate networks, and reliability is a fundamental attribute for their safe operation and optimal improvement. For a multistate network, the two-terminal reliability at demand level d, defined as the probability that the network capacity is greater than or equal to a demand of d units, can be calculated in terms of multistate minimal paths, called d-minimal paths (d-MPs) for short. This paper presents an efficient algorithm to find all d-MPs for the multistate two-terminal reliability problem. To advance the solution efficiency of d-MPs, an improved model is developed by redefining capacity constraints of network components and minimal paths (MPs). Furthermore, an effective technique is proposed to remove duplicate d-MPs that are generated multiple times during solution. A simple example is provided to demonstrate the proposed algorithm step by step. In addition, through computational experiments conducted on benchmark networks, it is found that the proposed algorithm is more efficient.

1 January 2016 in Discrete Dynamics in Nature and Society
Verified
Journal Article
Open access
PDF file
QZQi Zeng
Qi Zeng
XXXiu-Zhen Xu
Xiu-Zhen Xu
Reliability and transportation cost are two important indicators to measure the performance of logistics network. As a combination of reliability and transportation cost, the performance index R(d,c) of logistics network is defined as the probability that at least d units of flow demand can be successfully transmitted from the source to the destination with the total transportation cost less than or equal to c. In this paper, an algorithm is developed to calculate R(d,c) in terms of (d, c)‐minimal paths ((d, c)‐MPs for short). The proposed algorithm employs a decomposition technique to divide the search space of (d, c)‐MPs such that the search space of (d, c)‐MPs can be dramatically reduced, and thereby (d, c)‐MPs can be efficiently obtained. An example is provided to illustrate the proposed algorithm. Finally, computational experiments conducted on one benchmark network indicate that the proposed method has an advantage over the existing methods.

4 June 2024 in International Journal of Reliability, Quality and Safety Engineering
Verified
Journal Article
Closed access
YNYi-Feng Niu
Yi-Feng Niu
WCWancui Cai
Wancui Cai
XXXiuzhen Xu
Xiuzhen Xu