IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v25y2013i1d10.1007_s10878-011-9422-2.html
   My bibliography  Save this article

Computational risk management techniques for fixed charge network flow problems with uncertain arc failures

Author

Listed:
  • Alexey Sorokin

    (University of Florida)

  • Vladimir Boginski

    (University of Florida)

  • Artyom Nahapetyan

    (Waste Management)

  • Panos M. Pardalos

    (University of Florida)

Abstract

We consider a formulation for the fixed charge network flow (FCNF) problem subject to multiple uncertain arc failures, which aims to provide a robust optimal flow assignment in the sense of restricting potential losses using Conditional Value-at-Risk (CVaR). We show that a heuristic algorithm referred to as Adaptive Dynamic Cost Updating Procedure (ADCUP) previously developed for the deterministic FCNF problem can be extended to the considered problem under uncertainty and produce high-quality heuristic solutions for large problem instances. The reported computational experiments demonstrate that the described procedure can successfully tackle both the uncertainty considerations and the large size of the networks. High-quality heuristic solutions for problem instances with up to approximately 200,000 arcs have been identified in a reasonable time.

Suggested Citation

  • Alexey Sorokin & Vladimir Boginski & Artyom Nahapetyan & Panos M. Pardalos, 2013. "Computational risk management techniques for fixed charge network flow problems with uncertain arc failures," Journal of Combinatorial Optimization, Springer, vol. 25(1), pages 99-122, January.
    • Handle: RePEc:spr:jcomop:v:25:y:2013:i:1:d:10.1007_s10878-011-9422-2
    DOI: 10.1007/s10878-011-9422-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-011-9422-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-011-9422-2?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. PAVLO A. Krokhmal, 2007. "Higher moment coherent risk measures," Quantitative Finance, Taylor & Francis Journals, vol. 7(4), pages 373-387.
    2. Jeffery L. Kennington & Charles D. Nicholson, 2010. "The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 326-337, May.
    3. L. Cooper & C. Drebes, 1967. "An approximate solution method for the fixed charge problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 14(1), pages 101-113.
    4. Warren M. Hirsch & George B. Dantzig, 1968. "The fixed charge problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 15(3), pages 413-424, September.
    5. Richard S. Barr & Fred Glover & Darwin Klingman, 1981. "A New Optimization Method for Large Scale Fixed Charge Transportation Problems," Operations Research, INFORMS, vol. 29(3), pages 448-463, June.
    6. Alper Atamtürk & Muhong Zhang, 2007. "Two-Stage Robust Network Flow and Design Under Demand Uncertainty," Operations Research, INFORMS, vol. 55(4), pages 662-673, August.
    7. Jeff Kennington & Ed Unger, 1976. "A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem," Management Science, INFORMS, vol. 22(10), pages 1116-1126, June.
    8. Katta G. Murty, 1968. "Solving the Fixed Charge Problem by Ranking the Extreme Points," Operations Research, INFORMS, vol. 16(2), pages 268-279, April.
    9. Warren B. Powell, 1986. "A Stochastic Model of the Dynamic Vehicle Allocation Problem," Transportation Science, INFORMS, vol. 20(2), pages 117-129, May.
    10. David I. Steinberg, 1970. "The fixed charge problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 17(2), pages 217-235, June.
    11. A. Balakrishnan & T. L. Magnanti & R. T. Wong, 1989. "A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design," Operations Research, INFORMS, vol. 37(5), pages 716-740, October.
    12. ORTEGA , Francisco & WOLSEY, Laurence A., 2003. "A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem," LIDAM Reprints CORE 1611, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    13. David R. Denzler, 1969. "An approximative algorithm for the fixed charge problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 16(3), pages 411-416, September.
    14. A. Victor Cabot & S. Selcuk Erenguc, 1984. "Some branch‐and‐bound procedures for fixed‐cost transportation problems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 31(1), pages 145-154, March.
    15. Mike Hewitt & George L. Nemhauser & Martin W. P. Savelsbergh, 2010. "Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 314-325, May.
    16. Rockafellar, R. Tyrrell & Uryasev, Stanislav, 2002. "Conditional value-at-risk for general loss distributions," Journal of Banking & Finance, Elsevier, vol. 26(7), pages 1443-1471, July.
    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. Maciej Rysz & Mohammad Mirghorbani & Pavlo Krokhmal & Eduardo L. Pasiliao, 2014. "On risk-averse maximum weighted subgraph problems," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 167-185, July.
    2. 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.
    3. Zhang, C. & Liu, X. & Jiang, YP. & Fan, B. & Song, X., 2016. "A two-stage resource allocation model for lifeline systems quick response with vulnerability analysis," European Journal of Operational Research, Elsevier, vol. 250(3), pages 855-864.

    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. Jeffery L. Kennington & Charles D. Nicholson, 2010. "The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 326-337, May.
    2. Erika Buson & Roberto Roberti & Paolo Toth, 2014. "A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem," Operations Research, INFORMS, vol. 62(5), pages 1095-1106, October.
    3. Roberto Roberti & Enrico Bartolini & Aristide Mingozzi, 2015. "The Fixed Charge Transportation Problem: An Exact Algorithm Based on a New Integer Programming Formulation," Management Science, INFORMS, vol. 61(6), pages 1275-1291, June.
    4. Gurwinder Singh & Amarinder Singh, 2021. "Solving fixed-charge transportation problem using a modified particle swarm optimization algorithm," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 12(6), pages 1073-1086, December.
    5. Bala Shetty, 1990. "A relaxation/decomposition algorithm for the fixed charged network problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(2), pages 327-340, April.
    6. Yixin Zhao & Torbjörn Larsson & Elina Rönnberg & Panos M. Pardalos, 2018. "The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation," Journal of Global Optimization, Springer, vol. 72(3), pages 517-538, November.
    7. Sun, Minghe & Aronson, Jay E. & McKeown, Patrick G. & Drinka, Dennis, 1998. "A tabu search heuristic procedure for the fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 441-456, April.
    8. Yogesh Agarwal & Yash Aneja, 2012. "Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron," Operations Research, INFORMS, vol. 60(3), pages 638-654, June.
    9. Jesús Sáez Aguado, 2009. "Fixed Charge Transportation Problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems," Annals of Operations Research, Springer, vol. 172(1), pages 45-69, November.
    10. Agarwal, Y.K. & Aneja, Y.P. & Jayaswal, Sachin, 2022. "Directed fixed charge multicommodity network design: A cutting plane approach using polar duality," European Journal of Operational Research, Elsevier, vol. 299(1), pages 118-136.
    11. Geissel Sebastian & Sass Jörn & Seifried Frank Thomas, 2018. "Optimal expected utility risk measures," Statistics & Risk Modeling, De Gruyter, vol. 35(1-2), pages 73-87, January.
    12. Tong, Lu & Zhou, Xuesong & Miller, Harvey J., 2015. "Transportation network design for maximizing space–time accessibility," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 555-576.
    13. Lev, Benjamin & Kowalski, Krzysztof, 2011. "Modeling fixed-charge problems with polynomials," Omega, Elsevier, vol. 39(6), pages 725-728, December.
    14. Marcelo Brutti Righi & Paulo Sergio Ceretta, 2015. "Shortfall Deviation Risk: An alternative to risk measurement," Papers 1501.02007, arXiv.org, revised May 2016.
    15. Krokhmal, Pavlo A. & Soberanis, Policarpio, 2010. "Risk optimization with p-order conic constraints: A linear programming approach," European Journal of Operational Research, Elsevier, vol. 201(3), pages 653-671, March.
    16. Alexander Vinel & Pavlo A. Krokhmal, 2017. "Certainty equivalent measures of risk," Annals of Operations Research, Springer, vol. 249(1), pages 75-95, February.
    17. Maciej Rysz & Mohammad Mirghorbani & Pavlo Krokhmal & Eduardo L. Pasiliao, 2014. "On risk-averse maximum weighted subgraph problems," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 167-185, July.
    18. Jawahar, N. & Balaji, A.N., 2009. "A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge," European Journal of Operational Research, Elsevier, vol. 194(2), pages 496-537, April.
    19. Borisovsky, P. & Dolgui, A. & Eremeev, A., 2009. "Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder," European Journal of Operational Research, Elsevier, vol. 195(3), pages 770-779, June.
    20. Sant’Anna, Leonardo Riegel & Righi, Marcelo Brutti & Müller, Fernanda Maria & Guedes, Pablo Cristini, 2022. "Risk measure index tracking model," International Review of Economics & Finance, Elsevier, vol. 80(C), pages 361-383.

    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:spr:jcomop:v:25:y:2013:i:1:d:10.1007_s10878-011-9422-2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.