IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v238y2014i3p810-823.html
   My bibliography  Save this article

Fast computation of bounds for two-terminal network reliability

Author

Listed:
  • Sebastio, Stefano
  • Trivedi, Kishor S.
  • Wang, Dazhi
  • Yin, Xiaoyan

Abstract

In this paper, an algorithm for the fast computation of network reliability bounds is proposed. The evaluation of the network reliability is an intractable problem for very large networks, and hence approximate solutions based on reliability bounds have assumed importance. The proposed bounds computation algorithm is based on an efficient BDD representation of the reliability graph model and a novel search technique to find important minpaths/mincuts to quickly reduce the gap between the reliability upper and lower bounds. Furthermore, our algorithm allows the control of the gap between the two bounds by controlling the overall execution time. Therefore, a trade-off between prediction accuracy and computational resources can be easily made in our approach. The numerical results are presented for large real example reliability graphs to show the efficacy of our approach.

Suggested Citation

  • Sebastio, Stefano & Trivedi, Kishor S. & Wang, Dazhi & Yin, Xiaoyan, 2014. "Fast computation of bounds for two-terminal network reliability," European Journal of Operational Research, Elsevier, vol. 238(3), pages 810-823.
    • Handle: RePEc:eee:ejores:v:238:y:2014:i:3:p:810-823
    DOI: 10.1016/j.ejor.2014.04.035
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221714003774
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2014.04.035?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jane, Chin-Chia & Yuan, John, 2001. "A sum of disjoint products algorithm for reliability evaluation of flow networks," European Journal of Operational Research, Elsevier, vol. 131(3), pages 664-675, June.
    2. Zdravko I. Botev & Pierre L'Ecuyer & Gerardo Rubino & Richard Simard & Bruno Tuffin, 2013. "Static Network Reliability Estimation via Generalized Splitting," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 56-71, February.
    3. Jane, Chin-Chia & Shen, Wu-Hsien & Laih, Yih-Wenn, 2009. "Practical sequential bounds for approximating two-terminal reliability," European Journal of Operational Research, Elsevier, vol. 195(2), pages 427-441, June.
    4. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    5. Eugene L. Lawler, 1972. "A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem," Management Science, INFORMS, vol. 18(7), pages 401-405, March.
    6. Héctor Cancela & Pierre L’Ecuyer & Matías Lee & Gerardo Rubino & Bruno Tuffin, 2010. "Analysis and Improvements of Path-based Methods for Monte Carlo Reliability Evaluation of Static Models," Springer Series in Reliability Engineering, in: Javier Faulin & Angel A. Juan & Sebastián Martorell & José-Emmanuel Ramírez-Márquez (ed.), Simulation Methods for Reliability and Availability of Complex Systems, chapter 0, pages 65-84, Springer.
    7. George S. Fishman, 1986. "A Monte Carlo Sampling Plan for Estimating Network Reliability," Operations Research, INFORMS, vol. 34(4), pages 581-594, August.
    8. Joseph C. Hudson & Kailash C. Kapur, 1985. "Reliability Bounds for Multistate Systems with Multistate Components," Operations Research, INFORMS, vol. 33(1), pages 153-160, February.
    9. Hosam M. Aboelfotoh & Charles J. Colbourn, 1989. "Series-Parallel Bounds for the Two-Terminal Reliability Problem," INFORMS Journal on Computing, INFORMS, vol. 1(4), pages 209-222, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Huang, Ding-Hsiang & Huang, Cheng-Fu & Lin, Yi-Kuei, 2020. "A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks," European Journal of Operational Research, Elsevier, vol. 282(3), pages 1107-1114.
    2. Zhu, Huaxing & Zhang, Chi, 2019. "Expanding a complex networked system for enhancing its reliability evaluated by a new efficient approach," Reliability Engineering and System Safety, Elsevier, vol. 188(C), pages 205-220.
    3. Rychlik, Tomasz, 2017. "Evaluations of quantiles of system lifetime distributions," European Journal of Operational Research, Elsevier, vol. 256(3), pages 935-944.
    4. Forghani-elahabad, Majid & Kagan, Nelson & Mahdavi-Amiri, Nezam, 2019. "An MP-based approximation algorithm on reliability evaluation of multistate flow networks," Reliability Engineering and System Safety, Elsevier, vol. 191(C).
    5. 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).
    6. Vaibhav Gaur & Om Prakash Yadav & Gunjan Soni & Ajay Pal Singh Rathore, 2021. "A literature review on network reliability analysis and its engineering applications," Journal of Risk and Reliability, , vol. 235(2), pages 167-181, April.

    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. Jane, Chin-Chia & Laih, Yih-Wenn, 2010. "A dynamic bounding algorithm for approximating multi-state two-terminal reliability," European Journal of Operational Research, Elsevier, vol. 205(3), pages 625-637, September.
    2. Francesca Guerriero & Roberto Musmanno & Valerio Lacagnina & Antonio Pecorella, 2001. "A Class of Label-Correcting Methods for the K Shortest Paths Problem," Operations Research, INFORMS, vol. 49(3), pages 423-429, June.
    3. Guazzelli, Cauê Sauter & Cunha, Claudio B., 2018. "Exploring K-best solutions to enrich network design decision-making," Omega, Elsevier, vol. 78(C), pages 139-164.
    4. Sébastien Giguère & François Laviolette & Mario Marchand & Denise Tremblay & Sylvain Moineau & Xinxia Liang & Éric Biron & Jacques Corbeil, 2015. "Machine Learning Assisted Design of Highly Active Peptides for Drug Discovery," PLOS Computational Biology, Public Library of Science, vol. 11(4), pages 1-21, April.
    5. Reed, Sean & Löfstrand, Magnus & Andrews, John, 2019. "An efficient algorithm for computing exact system and survival signatures of K-terminal network reliability," Reliability Engineering and System Safety, Elsevier, vol. 185(C), pages 429-439.
    6. Pascoal, Marta M.B. & Sedeño-Noda, Antonio, 2012. "Enumerating K best paths in length order in DAGs," European Journal of Operational Research, Elsevier, vol. 221(2), pages 308-316.
    7. Antonio Sedeño-Noda, 2016. "Ranking One Million Simple Paths in Road Networks," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(05), pages 1-20, October.
    8. Fernández, Elena & Pozo, Miguel A. & Puerto, Justo & Scozzari, Andrea, 2017. "Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem," European Journal of Operational Research, Elsevier, vol. 260(3), pages 886-903.
    9. Pushak, Yasha & Hare, Warren & Lucet, Yves, 2016. "Multiple-path selection for new highway alignments using discrete algorithms," European Journal of Operational Research, Elsevier, vol. 248(2), pages 415-427.
    10. Maren Martens & Martin Skutella, 2009. "Flows with unit path capacities and related packing and covering problems," Journal of Combinatorial Optimization, Springer, vol. 18(3), pages 272-293, October.
    11. Sedeño-Noda, Antonio & González-Martín, Carlos, 2010. "On the K shortest path trees problem," European Journal of Operational Research, Elsevier, vol. 202(3), pages 628-635, May.
    12. Chan, Jianpeng & Papaioannou, Iason & Straub, Daniel, 2022. "An adaptive subset simulation algorithm for system reliability analysis with discontinuous limit states," Reliability Engineering and System Safety, Elsevier, vol. 225(C).
    13. Quang Minh Bui & Bernard Gendron & Margarida Carvalho, 2022. "A Catalog of Formulations for the Network Pricing Problem," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2658-2674, September.
    14. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    15. Yeh, Wei-Chang & Bae, Changseok & Huang, Chia-Ling, 2015. "A new cut-based algorithm for the multi-state flow network reliability problem," Reliability Engineering and System Safety, Elsevier, vol. 136(C), pages 1-7.
    16. 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.
    17. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    18. K.-P. Hui & N. Bean & M. Kraetzl & Dirk Kroese, 2005. "The Cross-Entropy Method for Network Reliability Estimation," Annals of Operations Research, Springer, vol. 134(1), pages 101-118, February.
    19. Doan, Xuan Vinh, 2022. "Distributionally robust optimization under endogenous uncertainty with an application in retrofitting planning," European Journal of Operational Research, Elsevier, vol. 300(1), pages 73-84.
    20. Hela Masri & Saoussen Krichen, 2018. "Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem," Annals of Operations Research, Springer, vol. 267(1), pages 353-377, August.

    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:eee:ejores:v:238:y:2014:i:3:p:810-823. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.