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

Majid Forghani-Elahabad, Nezam Mahdavi-Amiri and Nelson Kagan

International Journal of Operational Research, 2020, vol. 37, issue 4, 479-490

Abstract: In a stochastic-flow network, a (d, T, b, P₁, P₂)-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, P₁, P₂)-MPs, termed as the (d, T, b, P₁, P₂)-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, P₁, P₂)-MPs, and its correctness is established. The algorithm is compared with a recently proposed one to show the practical efficiency of the algorithm.

Keywords: stochastic quickest path reliability problem; transmission time; budget constraint; minimal paths; MPs; ( d , T , b , P 1 , P 2 )-MP. (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.inderscience.com/link.php?id=105764 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:37:y:2020:i:4:p:479-490

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().