IDEAS home Printed from https://ideas.repec.org/p/ess/wpaper/id2698.html
   My bibliography  Save this paper

Speeding Up the Estimation of Expected Maximum Flows Through Reliable Networks

Author

Listed:
  • Megha Sharma
  • Diptesh Ghosh

Abstract

In this paper we present a strategy for speeding up the estimation of expected maximum flows through reliable networks. Our strategy tries to minimize the repetition of computational effort while evaluating network states sampled using the crude Monte Carlo method. Computational experiments with this strategy on three types of randomly generated networks show that it reduces the number of flow augmentations required for evaluating the states in the sample by as much as 52% on average with a standard deviation of 7% compared to the conventional strategy. This leads to an average time saving of about 71% with a standard deviation of about 8%. [W.P. No. 2009-04-05]

Suggested Citation

  • Megha Sharma & Diptesh Ghosh, 2010. "Speeding Up the Estimation of Expected Maximum Flows Through Reliable Networks," Working Papers id:2698, eSocialSciences.
    • Handle: RePEc:ess:wpaper:id:2698
    Note: Institutional Papers
    as

    Download full text from publisher

    File URL: http://www.esocialsciences.org/Download/repecDownload.aspx?fname=Document12372010241.510257E-02.pdf&fcategory=Articles&AId=2698&fref=repec
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ahuja, Ravindra K. & Kodialam, Murali & Mishra, Ajay K. & Orlin, James B., 1997. "Computational investigations of maximum flow algorithms," European Journal of Operational Research, Elsevier, vol. 97(3), pages 509-542, March.
    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. Sedeño-Noda, A. & González-Dávila, E. & González-Martín, C. & González-Yanes, A., 2009. "Preemptive benchmarking problem: An approach for official statistics in small areas," European Journal of Operational Research, Elsevier, vol. 196(1), pages 360-369, July.
    2. 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.
    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 & Gao, Zi-You & Lam, William H.K., 2017. "Evaluating the reliability of a stochastic distribution network in terms of minimal cuts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 100(C), pages 75-97.
    5. Lee, Dongkyu & Song, Junho, 2023. "Risk-informed operation and maintenance of complex lifeline systems using parallelized multi-agent deep Q-network," Reliability Engineering and System Safety, Elsevier, vol. 239(C).
    6. Lysgaard, Jens, 2004. "Reachability cuts for the vehicle routing problem with time windows," CORAL Working Papers L-2004-01, University of Aarhus, Aarhus School of Business, Department of Business Studies.
    7. Alipour, Hossein & Muñoz, Mario Andrés & Smith-Miles, Kate, 2023. "Enhanced instance space analysis for the maximum flow problem," European Journal of Operational Research, Elsevier, vol. 304(2), pages 411-428.
    8. Niu, Yi-Feng & Lam, William H.K. & Gao, Ziyou, 2014. "An efficient algorithm for evaluating logistics network reliability subject to distribution cost," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 67(C), pages 175-189.
    9. Cole Smith, J., 2004. "Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network," European Journal of Operational Research, Elsevier, vol. 154(3), pages 659-672, May.
    10. Chin‐Chia Jane & Yih‐Wenn Laih, 2012. "Evaluating cost and reliability integrated performance of stochastic logistics systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(7), pages 577-586, October.
    11. Bala G. Chandran & Dorit S. Hochbaum, 2009. "A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem," Operations Research, INFORMS, vol. 57(2), pages 358-376, April.
    12. Xiu-Zhen Xu & Yi-Feng Niu & Qing Li, 2019. "Efficient Enumeration of - Minimal Paths in Reliability Evaluation of Multistate Networks," Complexity, Hindawi, vol. 2019, pages 1-10, March.
    13. 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).
    14. A. Sedeño-Noda & M. González-Sierra & C. González-Martín, 2000. "An algorithmic study of the Maximum Flow problem: A comparative statistical analysis," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 8(1), pages 135-162, June.
    15. Lysgaard, Jens, 2006. "Reachability cuts for the vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(1), pages 210-223, November.

    More about this item

    Keywords

    Network Flows; Reliable Networks; Cold Start; Warm Start; Reliable Network Evaluation Strategy;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:ess:wpaper:id:2698. 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: Padma Prakash (email available below). General contact details of provider: http://www.esocialsciences.org .

    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.