Photo from wikipedia
In a stochastic-flow network, a (d, T, b, P1, P2)-MP is a system state vector for which d units of flow can be transmitted through two separate minimal paths (SMPs)… Click to show full abstract
In a stochastic-flow network, a (d, T, b, P1, P2)-MP is a system state vector for which d units of flow can be transmitted through two separate minimal paths (SMPs) P1 and P2 simultaneously from a source node to a sink node satisfying time and budget limitations T and b, respectively. Problem of determining all the (d, T, b, P1, P2)-MPs, termed as the (d, T, b, P1, P2)-MP problem, has been attractive in reliability theory. Here, some new results are established for the problem. Using these results, a new algorithm is developed to find all the (d, T, b, P1, P2)-MPs, and its correctness is established. The algorithm is compared with a recently proposed one to show the practical efficiency of the algorithm.
Journal Title: International Journal of Operational Research
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!