IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i24p4889-d1295171.html
   My bibliography  Save this article

Using a Node–Child Matrix to Address the Quickest Path Problem in Multistate Flow Networks under Transmission Cost Constraints

Author

Listed:
  • Majid Forghani-elahabad

    (Center of Mathematics, Computing, and Cognition, Federal University of ABC, Santo André 09210-580, SP, Brazil)

  • Omar Mutab Alsalami

    (Department of Electrical Engineering, College of Engineering, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia)

Abstract

The quickest path problem in multistate flow networks, which is also known as the quickest path reliability problem (QPRP), aims at calculating the probability of successfully sending a minimum of d flow units/data/commodity from a source node to a destination node via one minimal path (MP) within a specified time frame of T units. Several exact and approximative algorithms have been proposed in the literature to address this problem. Most of the exact algorithms in the literature need prior knowledge of all of the network’s minimal paths (MPs), which is considered a weak point. In addition to the time, the budget is always limited in real-world systems, making it an essential consideration in the analysis of systems’ performance. Hence, this study considers the QPRP under cost constraints and provides an efficient approach based on a node–child matrix to address the problem without knowing the MPs. We show the correctness of the algorithm, compute the complexity results, illustrate it through a benchmark example, and describe our extensive experimental results on one thousand randomly generated test problems and well-established benchmarks to showcase its practical superiority over the available algorithms in the literature.

Suggested Citation

  • Majid Forghani-elahabad & Omar Mutab Alsalami, 2023. "Using a Node–Child Matrix to Address the Quickest Path Problem in Multistate Flow Networks under Transmission Cost Constraints," Mathematics, MDPI, vol. 11(24), pages 1-15, December.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:24:p:4889-:d:1295171
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/24/4889/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/24/4889/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Forghani-elahabad, Majid & Mahdavi-Amiri, Nezam, 2015. "An efficient algorithm for the multi-state two separate minimal paths reliability problem with budget constraint," Reliability Engineering and System Safety, Elsevier, vol. 142(C), pages 472-481.
    2. Alkaff, Abdullah & Qomarudin, Mochamad Nur & Bilfaqih, Yusuf, 2021. "Network reliability analysis: matrix-exponential approach," Reliability Engineering and System Safety, Elsevier, vol. 212(C).
    3. Forghani-elahabad, Majid & Yeh, Wei-Chang, 2022. "An improved algorithm for reliability evaluation of flow networks," Reliability Engineering and System Safety, Elsevier, vol. 221(C).
    4. Bai, Guanghan & Tian, Zhigang & Zuo, Ming J., 2016. "An improved algorithm for finding all minimal paths in a network," Reliability Engineering and System Safety, Elsevier, vol. 150(C), pages 1-10.
    5. Jiangbin Zhao & Mengtao Liang & Rongyu Tian & Zaoyan Zhang & Xiangang Cao, 2023. "Reliability Optimization of Hybrid Systems Driven by Constraint Importance Measure Considering Different Cost Functions," Mathematics, MDPI, vol. 11(20), pages 1-21, October.
    6. Michael Hart Moore, 1976. "On the Fastest Route for Convoy-Type Traffic in Flowrate-Constrained Networks," Transportation Science, INFORMS, vol. 10(2), pages 113-124, May.
    7. Yeh, Wei-Chang, 2007. "An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths," Reliability Engineering and System Safety, Elsevier, vol. 92(2), pages 260-268.
    8. Kozyra, Paweł Marcin, 2023. "The usefulness of (d,b)-MCs and (d,b)-MPs in network reliability evaluation under delivery or maintenance cost constraints," Reliability Engineering and System Safety, Elsevier, vol. 234(C).
    9. Forghani-elahabad, Majid & Francesquini, Emilio, 2023. "Usage of task and data parallelism for finding the lower boundary vectors in a stochastic-flow network," Reliability Engineering and System Safety, Elsevier, vol. 238(C).
    10. Niu, Yi-Feng & Gao, Zi-You & Lam, William H.K., 2017. "A new efficient algorithm for finding all d-minimal cuts in multi-state networks," Reliability Engineering and System Safety, Elsevier, vol. 166(C), pages 151-163.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Forghani-elahabad, Majid & Yeh, Wei-Chang, 2022. "An improved algorithm for reliability evaluation of flow networks," Reliability Engineering and System Safety, Elsevier, vol. 221(C).
    2. Yi-Kuei Lin & Lance Fiondella & Ping-Chen Chang, 2022. "Reliability of time-constrained multi-state network susceptible to correlated component faults," Annals of Operations Research, Springer, vol. 311(1), pages 239-254, April.
    3. Niu, Yi-Feng & Wan, Xiao-Yu & Xu, Xiu-Zhen & Ding, Dong, 2020. "Finding all multi-state minimal paths of a multi-state flow network via feasible circulations," Reliability Engineering and System Safety, Elsevier, vol. 204(C).
    4. Schäfer, Lukas & García, Sergio & Srithammavanh, Vassili, 2018. "Simplification of inclusion–exclusion on intersections of unions with application to network systems reliability," Reliability Engineering and System Safety, Elsevier, vol. 173(C), pages 23-33.
    5. Thi-Phuong Nguyen, 2021. "Assess the Impacts of Discount Policies on the Reliability of a Stochastic Air Transport Network," Mathematics, MDPI, vol. 9(9), pages 1-13, April.
    6. Lin, Yi-Kuei, 2010. "Calculation of minimal capacity vectors through k minimal paths under budget and time constraints," European Journal of Operational Research, Elsevier, vol. 200(1), pages 160-169, January.
    7. Huang, Cheng-Fu & Huang, Ding-Hsiang & Lin, Yi-Kuei, 2022. "Network reliability evaluation for multi-state computing networks considering demand as the non-integer type," Reliability Engineering and System Safety, Elsevier, vol. 219(C).
    8. Monfared, M.A.S. & Rezazadeh, Masoumeh & Alipour, Zohreh, 2022. "Road networks reliability estimations and optimizations: A Bi-directional bottom-up, top-down approach," Reliability Engineering and System Safety, Elsevier, vol. 222(C).
    9. Kozyra, Paweł Marcin, 2023. "The usefulness of (d,b)-MCs and (d,b)-MPs in network reliability evaluation under delivery or maintenance cost constraints," Reliability Engineering and System Safety, Elsevier, vol. 234(C).
    10. Yi-Kuei Lin & Thi-Phuong Nguyen & Louis Cheng-Lu Yeng, 2022. "Reliability evaluation of a stochastic multimodal transport network under time and budget considerations," Annals of Operations Research, Springer, vol. 312(1), pages 369-387, May.
    11. Zhang, Hanxiao & Sun, Muxia & Li, Yan-Fu, 2022. "Reliability–redundancy allocation problem in multi-state flow network: Minimal cut-based approximation scheme," Reliability Engineering and System Safety, Elsevier, vol. 225(C).
    12. Ashutosh Sharma & Rajiv Kumar & Manar Wasif Abu Talib & Saurabh Srivastava & Razi Iqbal, 2019. "Network modelling and computation of quickest path for service-level agreements using bi-objective optimization," International Journal of Distributed Sensor Networks, , vol. 15(10), pages 15501477198, October.
    13. Herminia Calvete & Lourdes del-Pozo & José Iranzo, 2012. "Algorithms for the quickest path problem and the reliable quickest path problem," Computational Management Science, Springer, vol. 9(2), pages 255-272, May.
    14. Li, Jian & Dueñas-Osorio, Leonardo & Chen, Changkun & Shi, Congling, 2016. "Connectivity reliability and topological controllability of infrastructure networks: A comparative assessment," Reliability Engineering and System Safety, Elsevier, vol. 156(C), pages 24-33.
    15. Yeh, Wei-Chang, 2021. "Novel binary-addition tree algorithm (BAT) for binary-state network reliability problem," Reliability Engineering and System Safety, Elsevier, vol. 208(C).
    16. Ding-Hsiang Huang & Cheng-Fu Huang & Yi-Kuei Lin, 2019. "Reliability Evaluation for a Stochastic Flow Network Based on Upper and Lower Boundary Vectors," Mathematics, MDPI, vol. 7(11), pages 1-12, November.
    17. Xu, Bei & Liu, Tao & Bai, Guanghan & Tao, Junyong & Zhang, Yun-an & Fang, Yining, 2022. "A multistate network approach for reliability evaluation of unmanned swarms by considering information exchange capacity," Reliability Engineering and System Safety, Elsevier, vol. 219(C).
    18. Calvete, Herminia I. & del-Pozo, Lourdes & Iranzo, José A., 2018. "Dealing with residual energy when transmitting data in energy-constrained capacitated networks," European Journal of Operational Research, Elsevier, vol. 269(2), pages 602-620.
    19. Davila-Frias, Alex & Yodo, Nita & Le, Trung & Yadav, Om Prakash, 2023. "A deep neural network and Bayesian method based framework for all-terminal network reliability estimation considering degradation," Reliability Engineering and System Safety, Elsevier, vol. 229(C).
    20. Yeh, Wei-Chang & Hao, Zhifeng & Forghani-elahabad, Majid & Wang, Gai-Ge & Lin, Yih-Lon, 2021. "Novel Binary-Addition Tree Algorithm for Reliability Evaluation of Acyclic Multistate Information Networks," Reliability Engineering and System Safety, Elsevier, vol. 210(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:24:p:4889-:d:1295171. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.