This paper presents a d-minimal cut based algorithm to evaluate the performance index Rd+i of a distribution network, defined as the probability that a specified demand d + 1 can be successfully distributed through stochastic arc capacities from the source to the destination. To improve the efficiency of solving d-minimal cuts, a novel technique is developed to determine the minimal capacities of arcs. Also, two new judging criteria are proposed to detect duplicate d -minimal cuts. Both theoretical and computational results indicate that our algorithm outperforms the existing methods. Furthermore, a real case study is provided to illustrate the application of the algorithm.Department of Civil and Environmental Engineerin
Many real-world systems are multi-state systems composed of multi-state components in which the reli...
[[abstract]]This article is mainly to study the reliability evaluation in terms of MPs (minimal path...
Under the assumption that each branch’ capacity of the network is deterministic, the quickest ...
This paper presents a (d, c)-minimal paths based algorithm to evaluate the reliability index R(d,c),...
AbstractThis paper discusses a stochastic-flow network from single-commodity case to multicommodity ...
The paper presents a genetic algorithm to generate minimal cuts for a stochastic flow network with c...
Many real-world systems (such as electric power, transportation, etc.) are multistate systems compos...
A MP/minimal cutset (MC) is a path/cut set such that if any edge is removed from this path/cut set, ...
Evaluating the reliability of a distribution network is basically calculating the capability of each...
[[abstract]]© 2004 Elsevier - Many real-world systems (such as electric power, transportation, etc.)...
This paper focuses on performance assessment of a freight network with stochastic capacities by usin...
For a single-commodity stochastic flow network, the system capacity is the maximum flow from the sou...
This paper proposes an algorithm to evaluate the probability that d units of data can be sent from t...
Project models the reliability of an urban water distribution network.. Reliability is one of the fu...
Many real-world systems are multistate systems composed of multistate components in which the reliab...
Many real-world systems are multi-state systems composed of multi-state components in which the reli...
[[abstract]]This article is mainly to study the reliability evaluation in terms of MPs (minimal path...
Under the assumption that each branch’ capacity of the network is deterministic, the quickest ...
This paper presents a (d, c)-minimal paths based algorithm to evaluate the reliability index R(d,c),...
AbstractThis paper discusses a stochastic-flow network from single-commodity case to multicommodity ...
The paper presents a genetic algorithm to generate minimal cuts for a stochastic flow network with c...
Many real-world systems (such as electric power, transportation, etc.) are multistate systems compos...
A MP/minimal cutset (MC) is a path/cut set such that if any edge is removed from this path/cut set, ...
Evaluating the reliability of a distribution network is basically calculating the capability of each...
[[abstract]]© 2004 Elsevier - Many real-world systems (such as electric power, transportation, etc.)...
This paper focuses on performance assessment of a freight network with stochastic capacities by usin...
For a single-commodity stochastic flow network, the system capacity is the maximum flow from the sou...
This paper proposes an algorithm to evaluate the probability that d units of data can be sent from t...
Project models the reliability of an urban water distribution network.. Reliability is one of the fu...
Many real-world systems are multistate systems composed of multistate components in which the reliab...
Many real-world systems are multi-state systems composed of multi-state components in which the reli...
[[abstract]]This article is mainly to study the reliability evaluation in terms of MPs (minimal path...
Under the assumption that each branch’ capacity of the network is deterministic, the quickest ...