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

Practical sequential bounds for approximating two-terminal reliability

Author

Listed:
  • Jane, Chin-Chia
  • Shen, Wu-Hsien
  • Laih, Yih-Wenn

Abstract

With increasing emphases on better and more reliable services, network systems have incorporated reliability analysis as an integral part in their planning, design and operation. This article first presents a simple exact decomposition algorithm for computing the NP-hard two-terminal reliability, which measures the probability of successful communication from specified source node to sink node in the network. Then a practical bounding algorithm, which is indispensable for large networks, is presented by modifying the exact algorithm for obtaining sequential lower and upper bounds on two-terminal reliability. Based on randomly generated large networks, computational experiments are conducted to compare the proposed algorithm to the well-known and widely used edge-packing approximation model and to explore the performance of the proposed bounding algorithm. Computational results reveal that the proposed bounding algorithm is superior to the edge-packing model, and the trade-off of accuracy for execution time ensures that an exact difference between upper and lower bounds on two-terminal reliability can be obtained within an acceptable time.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:195:y:2009:i:2:p:427-441
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00223-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. D. Klingman & A. Napier & J. Stutz, 1974. "NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems," Management Science, INFORMS, vol. 20(5), pages 814-821, January.
    3. Cook, Jason L. & Ramirez-Marquez, Jose Emmanuel, 2007. "Two-terminal reliability analyses for a mobile ad hoc wireless network," Reliability Engineering and System Safety, Elsevier, vol. 92(6), pages 821-829.
    4. Malinowski, Jacek, 2007. "Node-pair reliability of network systems with small distances between adjacent nodes," Reliability Engineering and System Safety, Elsevier, vol. 92(4), pages 479-489.
    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. 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.
    2. Yeh, Wei-Chang, 2022. "Novel self-adaptive Monte Carlo simulation based on binary-addition-tree algorithm for binary-state network reliability approximation," Reliability Engineering and System Safety, Elsevier, vol. 228(C).
    3. 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.
    4. Niu, Yi-Feng & Wang, Jun-Feng & Xu, Xiu-Zhen & Xu, Qian-Xin, 2025. "Reliability evaluation for a multi-commodity multi-state distribution network under transportation emission consideration," Reliability Engineering and System Safety, Elsevier, vol. 254(PA).
    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. Cui, Hongjun & Wang, Fei & Ma, Xinwei & Zhu, Minqing, 2022. "A novel fixed-node unconnected subgraph method for calculating the reliability of binary-state networks," Reliability Engineering and System Safety, Elsevier, vol. 226(C).

    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. Gutierrez, Genaro J. & Kouvelis, Panagiotis & Kurawarwala, Abbas A., 1996. "A robustness approach to uncapacitated network design problems," European Journal of Operational Research, Elsevier, vol. 94(2), pages 362-376, October.
    2. Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
    3. Gerald G. Brown & W. Matthew Carlyle, 2020. "Solving the Nearly Symmetric All-Pairs Shortest-Path Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 279-288, April.
    4. Rocco S, Claudio M. & Ramirez-Marquez, José Emmanuel, 2009. "Deterministic network interdiction optimization via an evolutionary approach," Reliability Engineering and System Safety, Elsevier, vol. 94(2), pages 568-576.
    5. Balaji Gopalakrishnan & Seunghyun Kong & Earl Barnes & Ellis Johnson & Joel Sokol, 2011. "A least-squares minimum-cost network flow algorithm," Annals of Operations Research, Springer, vol. 186(1), pages 119-140, June.
    6. Festa, P. & Guerriero, F. & Laganà, D. & Musmanno, R., 2013. "Solving the shortest path tour problem," European Journal of Operational Research, Elsevier, vol. 230(3), pages 464-474.
    7. Yves Pochet & Mathieu Van Vyve, 2004. "A General Heuristic for Production Planning Problems," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 316-327, August.
    8. Cook, Jason L. & Ramirez-Marquez, Jose Emmanuel, 2009. "Optimal design of cluster-based ad-hoc networks using probabilistic solution discovery," Reliability Engineering and System Safety, Elsevier, vol. 94(2), pages 218-228.
    9. R. Fourer & H. Gassmann & J. Ma & R. Martin, 2009. "An XML-based schema for stochastic programs," Annals of Operations Research, Springer, vol. 166(1), pages 313-337, February.
    10. Maya Duque, Pablo A. & Coene, Sofie & Goos, Peter & Sörensen, Kenneth & Spieksma, Frits, 2013. "The accessibility arc upgrading problem," European Journal of Operational Research, Elsevier, vol. 224(3), pages 458-465.
    11. ÇalIskan, Cenk, 2011. "A specialized network simplex algorithm for the constrained maximum flow problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 137-147, April.
    12. Mongeau, Marcel & Sartenaer, Annick, 1995. "Automatic decrease of the penalty parameter in exact penalty function methods," European Journal of Operational Research, Elsevier, vol. 83(3), pages 686-699, June.
    13. Mesquita-Cunha, Mariana & Figueira, José Rui & Barbosa-Póvoa, Ana Paula, 2023. "New ϵ−constraint methods for multi-objective integer linear programming: A Pareto front representation approach," European Journal of Operational Research, Elsevier, vol. 306(1), pages 286-307.
    14. Granat, Janusz & Guerriero, Francesca, 2003. "The interactive analysis of the multicriteria shortest path problem by the reference point method," European Journal of Operational Research, Elsevier, vol. 151(1), pages 103-118, November.
    15. Moreno, Alfredo & Munari, Pedro & Alem, Douglas, 2019. "A branch-and-Benders-cut algorithm for the Crew Scheduling and Routing Problem in road restoration," European Journal of Operational Research, Elsevier, vol. 275(1), pages 16-34.
    16. 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.
    17. Larsson, Torbjörn & Marklund, Johan & Olsson, Caroline & Patriksson, Michael, 2008. "Convergent Lagrangian heuristics for nonlinear minimum cost network flows," European Journal of Operational Research, Elsevier, vol. 189(2), pages 324-346, September.
    18. P. Beraldi & F. Guerriero & R. Musmanno, 1997. "Efficient Parallel Algorithms for the Minimum Cost Flow Problem," Journal of Optimization Theory and Applications, Springer, vol. 95(3), pages 501-530, December.
    19. Padmavathy, N. & Chaturvedi, Sanjay K., 2013. "Evaluation of mobile ad hoc network reliability using propagation-based link reliability model," Reliability Engineering and System Safety, Elsevier, vol. 115(C), pages 1-9.
    20. Dayal Madhukar & Verma, Sanjay, 2015. "Multi-processor Exact Procedures for Regular Measures of the Multi-mode RCPSP," IIMA Working Papers WP2015-03-25, Indian Institute of Management Ahmedabad, Research and Publication Department.

    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:195:y:2009:i:2:p:427-441. 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.