scholarly journals Reliability Evaluation for a Stochastic Flow Network Based on Upper and Lower Boundary Vectors

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1115
Author(s):  
Huang ◽  
Huang ◽  
Lin

For stochastic flow network (SFN), given all the lower (or upper) boundary points, the classic problem is to calculate the probability that the capacity vectors are greater than or equal to the lower boundary points (less than or equal to the upper boundary points). However, in some practical cases, SFN reliability would be evaluated between the lower and upper boundary points at the same time. The evaluation of SFN reliability with upper and lower boundary points at the same time is the focus of this paper. Because of intricate relationships among upper and lower boundary points, a decomposition approach is developed to obtain several simplified subsets. SFN reliability is calculated according to these subsets by means of the inclusion-exclusion principle. Two heuristic options are then established in order to calculate SFN reliability in an efficient direction based on the lower and upper boundary points.

2014 ◽  
Vol 10 (3) ◽  
pp. 13-23 ◽  
Author(s):  
Seyed Mehdi Mansourzadeh ◽  
Seyed Hadi Nasseri ◽  
Majid Forghani-elahabad ◽  
Ali Ebrahimnejad

An information system network (ISN) can be modeled as a stochastic-flow network (SFN). There are several algorithms to evaluate reliability of an SFN in terms of Minimal Cuts (MCs). The existing algorithms commonly first find all the upper boundary points (called d-MCs) in an SFN, and then determine the reliability of the network using some approaches such as inclusion-exclusion method, sum of disjoint products, etc. However, most of the algorithms have been compared via complexity results or through one or two benchmark networks. Thus, comparing those algorithms through random test problems can be desired. Here, the authors first state a simple improved algorithm. Then, by generating a number of random test problems and implementing the algorithms in MATLAB, the proposed algorithm is demonstrated to be more efficient than some existing ones in medium-sized networks. The performance profile introduced by Dolan and More is used for analyzing the output of programs.


2014 ◽  
Vol 12 (8) ◽  
pp. 3749-3757
Author(s):  
M. R. Hassan

The system reliability (Rd,c) calculation is based on the generation of all the lower boundary points for the given demand, d, such that the total transmission cost is less than or equal to c (budget). This generation of the lower boundary points is based on finding all feasible solutions to the flow vector, F. The number of feasible solutions cannot be anticipated. Thus, a genetic algorithm is useful for solving this problem. Therefore, this paper presents a genetic algorithm to generate all feasible solutions to the flow vector, F, and then calculate Rd,c. The algorithm is applied to two problem models. In the first, each arc of a flow network has several capacities and may fail. In the second, both the arc and node have several capacities and may fail. The results show that the algorithm is efficient at solving a flow problem and is useful for calculating Rd,c.


2020 ◽  
Vol 69 (4) ◽  
pp. 1239-1253 ◽  
Author(s):  
Yihai He ◽  
Zhaoxiang Chen ◽  
Yixiao Zhao ◽  
Xiao Han ◽  
Di Zhou

Sign in / Sign up

Export Citation Format

Share Document