IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v47y2015i9p961-977.html
   My bibliography  Save this article

Loss-constrained minimum cost flow under arc failure uncertainty with applications in risk-aware kidney exchange

Author

Listed:
  • Qipeng P. Zheng
  • Siqian Shen
  • Yuhui Shi

Abstract

In this article, we study a Stochastic Minimum Cost Flow (SMCF) problem under arc failure uncertainty, where an arc flow solution may correspond to multiple path flow representations. We assume that the failure of an arc will cause flow losses on all paths using that arc, and for any path carrying positive flows, the failure of any arc on the path will lose all flows carried by the path. We formulate two SMCF variants to minimize the cost of arc flows, while respectively restricting the Value-at-Risk (VaR) and Conditional Value-at-Risk (CVaR) of random path flow losses due to uncertain arc failure (reflected as network topological changes). We formulate a linear program to compute possible losses, yielding a mixed-integer programming formulation of SMCF-VaR and a linear programming formulation of SMCF-CVaR. We present a kidney exchange problem under uncertain match failure as an application and use the two SMCF models to maximize the utility/social welfare of pairing kidneys subject to constrained risk of utility losses. Our results show the efficacy of our approaches, the conservatism of using CVaR, and optimal flow patterns given by VaR and CVaR models on diverse instances.

Suggested Citation

  • Qipeng P. Zheng & Siqian Shen & Yuhui Shi, 2015. "Loss-constrained minimum cost flow under arc failure uncertainty with applications in risk-aware kidney exchange," IISE Transactions, Taylor & Francis Journals, vol. 47(9), pages 961-977, September.
  • Handle: RePEc:taf:uiiexx:v:47:y:2015:i:9:p:961-977
    DOI: 10.1080/0740817X.2014.991476
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2014.991476
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/0740817X.2014.991476?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.

    Citations

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


    Cited by:

    1. Hyunwoo Lee & Seokhyun Chung & Taesu Cheong & Sang Hwa Song, 2018. "Accounting for Fairness in a Two-Stage Stochastic Programming Model for Kidney Exchange Programs," IJERPH, MDPI, vol. 15(7), pages 1-16, July.
    2. Pengfei Zhang & Neng Fan, 2017. "Analysis of budget for interdiction on multicommodity network flows," Journal of Global Optimization, Springer, vol. 67(3), pages 495-525, March.
    3. Anna Timonina‐Farkas & René Y. Glogg & Ralf W. Seifert, 2022. "Limiting the impact of supply chain disruptions in the face of distributional uncertainty in demand," Production and Operations Management, Production and Operations Management Society, vol. 31(10), pages 3788-3805, October.
    4. Zhouchun Huang & Qipeng Phil Zheng & Eduardo Pasiliao & Vladimir Boginski & Tao Zhang, 2019. "A cutting plane method for risk-constrained traveling salesman problem with random arc costs," Journal of Global Optimization, Springer, vol. 74(4), pages 839-859, August.
    5. Juan Ma & Balabhaskar Balasundaram, 2019. "On the chance-constrained minimum spanning k-core problem," Journal of Global Optimization, Springer, vol. 74(4), pages 783-801, August.
    6. Zhouchun Huang & Qipeng P. Zheng & Eduardo L. Pasiliao & Daniel Simmons, 2017. "Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios," Annals of Operations Research, Springer, vol. 249(1), pages 141-162, February.
    7. René Y. Glogg & Anna Timonina-Farkas & Ralf W. Seifert, 2022. "Modeling and mitigating supply chain disruptions as a bilevel network flow problem," Computational Management Science, Springer, vol. 19(3), pages 395-423, July.

    More about this item

    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:taf:uiiexx:v:47:y:2015:i:9:p:961-977. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.