IDEAS home Printed from https://ideas.repec.org/a/spr/eurjco/v4y2016i3d10.1007_s13675-016-0067-x.html
   My bibliography  Save this article

Robust flows with losses and improvability in evacuation planning

Author

Listed:
  • Marc Goerigk

    (Lancaster University)

  • Ismaila Abderhamane Ndiaye

    (Université François-Rabelais de Tours)

Abstract

We consider a network flow problem, where the outgoing flow is reduced by a certain percentage in each node. Given a maximum amount of flow that can leave the source node, the aim is to find a solution that maximizes the amount of flow which arrives at the sink. Starting from this basic model, we include two new, additional aspects: On the one hand, we are able to reduce the loss at some of the nodes; on the other hand, the exact loss values are not known, but may come from a discrete uncertainty set of exponential size. Applications for problems of this type can be found in evacuation planning, where one would like to improve the safety of nodes such that the number of evacuees reaching safety is maximized. We formulate the resulting robust flow problem with losses and improvability as a two-stage mixed-integer program with uncertain recourse for finitely many scenarios and present an iterative scenario-generation procedure that avoids the inclusion of all scenarios from the beginning as well as several heuristic solution methods. In a computational study using both randomly generated instances and realistic data based on the city of Nice, France, we compare our solution algorithms.

Suggested Citation

  • Marc Goerigk & Ismaila Abderhamane Ndiaye, 2016. "Robust flows with losses and improvability in evacuation planning," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(3), pages 241-270, September.
    • Handle: RePEc:spr:eurjco:v:4:y:2016:i:3:d:10.1007_s13675-016-0067-x
    DOI: 10.1007/s13675-016-0067-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13675-016-0067-x
    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/s13675-016-0067-x?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. Xie, Chi & Lin, Dung-Ying & Travis Waller, S., 2010. "A dynamic evacuation network optimization problem with lane reversal and crossing elimination strategies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(3), pages 295-316, May.
    2. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    3. S Opasanon & E Miller-Hooks, 2009. "The Safest Escape problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1749-1758, December.
    4. Tomasz Radzik, 1998. "Faster Algorithms for the Generalized Network Flow Problem," Mathematics of Operations Research, INFORMS, vol. 23(1), pages 69-100, February.
    5. L. G. Chalmet & R. L. Francis & P. B. Saunders, 1982. "Network Models for Building Evacuation," Management Science, INFORMS, vol. 28(1), pages 86-105, January.
    6. Altay, Nezih & Green III, Walter G., 2006. "OR/MS research in disaster operations management," European Journal of Operational Research, Elsevier, vol. 175(1), pages 475-493, November.
    7. Choi, W. & Hamacher, H. W. & Tufekci, S., 1988. "Modeling of building evacuation problems by network flows with side constraints," European Journal of Operational Research, Elsevier, vol. 35(1), pages 98-110, April.
    8. Aissi, Hassene & Bazgan, Cristina & Vanderpooten, Daniel, 2009. "Min-max and min-max regret versions of combinatorial optimization problems: A survey," European Journal of Operational Research, Elsevier, vol. 197(2), pages 427-438, September.
    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. Shin, Youngchul & Moon, Ilkyeong, 2023. "Robust building evacuation planning in a dynamic network flow model under collapsible nodes and arcs," Socio-Economic Planning Sciences, Elsevier, vol. 86(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. Goerigk, Marc & Deghdak, Kaouthar & Heßler, Philipp, 2014. "A comprehensive evacuation planning model and genetic solution algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 71(C), pages 82-97.
    2. Shin, Youngchul & Moon, Ilkyeong, 2023. "Robust building evacuation planning in a dynamic network flow model under collapsible nodes and arcs," Socio-Economic Planning Sciences, Elsevier, vol. 86(C).
    3. Chassein, André & Dokka, Trivikram & Goerigk, Marc, 2019. "Algorithms and uncertainty sets for data-driven robust shortest path problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 671-686.
    4. Fang, Zhixiang & Zong, Xinlu & Li, Qingquan & Li, Qiuping & Xiong, Shengwu, 2011. "Hierarchical multi-objective evacuation routing in stadium using ant colony optimization approach," Journal of Transport Geography, Elsevier, vol. 19(3), pages 443-451.
    5. Lu, Chung-Cheng & Ying, Kuo-Ching & Chen, Hui-Ju, 2016. "Real-time relief distribution in the aftermath of disasters – A rolling horizon approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 1-20.
    6. Pursals, Salvador Casadesús & Garzón, Federico Garriga, 2009. "Optimal building evacuation time considering evacuation routes," European Journal of Operational Research, Elsevier, vol. 192(2), pages 692-699, January.
    7. Li, Lingfeng & Jin, Mingzhou & Zhang, Li, 2011. "Sheltering network planning and management with a case in the Gulf Coast region," International Journal of Production Economics, Elsevier, vol. 131(2), pages 431-440, June.
    8. Marc Goerigk & Adam Kasperski & Paweł Zieliński, 2022. "Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty," Journal of Combinatorial Optimization, Springer, vol. 43(3), pages 497-527, April.
    9. Cohen, Izack & Postek, Krzysztof & Shtern, Shimrit, 2023. "An adaptive robust optimization model for parallel machine scheduling," European Journal of Operational Research, Elsevier, vol. 306(1), pages 83-104.
    10. Zhang, Jianghua & Long, Daniel Zhuoyu & Li, Yuchen, 2023. "A reliable emergency logistics network for COVID-19 considering the uncertain time-varying demands," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 172(C).
    11. Chassein, André & Goerigk, Marc, 2018. "Variable-sized uncertainty and inverse problems in robust optimization," European Journal of Operational Research, Elsevier, vol. 264(1), pages 17-28.
    12. Detienne, Boris & Lefebvre, Henri & Malaguti, Enrico & Monaci, Michele, 2024. "Adjustable robust optimization with objective uncertainty," European Journal of Operational Research, Elsevier, vol. 312(1), pages 373-384.
    13. Alf Kimms & Marc Maiwald, 2017. "An exact network flow formulation for cell‐based evacuation in urban areas," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(7), pages 547-555, October.
    14. Jorge A. Huertas & Daniel Duque & Ethel Segura-Durán & Raha Akhavan-Tabatabaei & Andrés L. Medaglia, 2020. "Evacuation dynamics: a modeling and visualization framework," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(3), pages 661-691, September.
    15. Ismaila Abderhamane Ndiaye & Emmanuel Neron & Antoine Jouglet, 2017. "Macroscopic evacuation plans for natural disasters," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 231-272, January.
    16. Pyakurel, Urmila & Khanal, Durga Prasad & Dhamala, Tanka Nath, 2023. "Abstract network flow with intermediate storage for evacuation planning," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1178-1193.
    17. Amadeu A. Coco & Andréa Cynthia Santos & Thiago F. Noronha, 2022. "Robust min-max regret covering problems," Computational Optimization and Applications, Springer, vol. 83(1), pages 111-141, September.
    18. Goerigk, Marc & Deghdak, Kaouthar & T’Kindt, Vincent, 2015. "A two-stage robustness approach to evacuation planning with buses," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 66-82.
    19. Fabrice Talla Nobibon & Roel Leus, 2014. "Complexity Results and Exact Algorithms for Robust Knapsack Problems," Journal of Optimization Theory and Applications, Springer, vol. 161(2), pages 533-552, May.
    20. Ghazaleh Ahmadi & Reza Tavakkoli-Moghaddam & Armand Baboli & Mehdi Najafi, 2022. "A decision support model for robust allocation and routing of search and rescue resources after earthquake: a case study," Operational Research, Springer, vol. 22(2), pages 1039-1081, April.

    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:eurjco:v:4:y:2016:i:3:d:10.1007_s13675-016-0067-x. 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.