An efficient alternative to the exact evaluation of the quickest path flow network reliability problem

2016 ◽  
Vol 76 ◽  
pp. 22-32 ◽  
Author(s):  
M. El Khadiri ◽  
W.-C. Yeh
Keyword(s):  
Network Reliability ◽  
Flow Network ◽  
Reliability Problem ◽  
Quickest Path ◽  
Exact Evaluation ◽  
Efficient Alternative

Modeling and Applications on Timed Stochastic-Flow Networks

2015 ◽  
Vol 22 (05) ◽  
pp. 1550023
Author(s):  
Shin-Guang Chen
Keyword(s):  
Network Reliability ◽  
Daily Life ◽  
Transportation Network ◽  
Stochastic Flow ◽  
Production Network ◽  
Flow Networks ◽  
Stochastic Behavior ◽  
Flow Network ◽  
Numerical Examples ◽  
Time Consumption

A stochastic-flow network (SFN) is a network whose flow has stochastic behavior or probabilistic multi-states. A timed stochastic-flow network (TSFN) is a SFN whose flow spends time to go through the network. Traditionally, the evaluation of network reliability does not consider time consumption for the flow to get through the network. However, there are lots of daily-life networks which can be regarded as TSFNs, such as the transportation network, the production network, etc. Their flow spends time to get through the network, and they are not yet explored in the literature. This paper proposes approaches to evaluate the reliability of such networks. Some numerical examples are discussed to illustrate the proposed method.

Sign in / Sign up

Export Citation Format

Share Document