Loading...

On multi-state two separate minimal paths reliability problem with time and budget constraints

Forghani Elahabad, M ; Sharif University of Technology | 2020

315 Viewed
  1. Type of Document: Article
  2. DOI: 10.1504/IJOR.2020.105764
  3. Publisher: Inderscience Publishers , 2020
  4. Abstract:
  5. 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. Copyright © 2020 Inderscience Enterprises Ltd
  6. Keywords:
  7. (D,T,b,P1,-MP2)-MP ; Budget constraint ; Minimal paths ; MPs ; Stochastic quickest path reliability problem ; Transmission time
  8. Source: International Journal of Operational Research ; Volume 37, Issue 4 , 2020 , Pages 479-490
  9. URL: https://www.inderscience.com/info/inarticle.php?artid=105764