IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v83y2016icp136-150.html
   My bibliography  Save this article

A conflict-based path-generation heuristic for evacuation planning

Author

Listed:
  • Pillac, Victor
  • Van Hentenryck, Pascal
  • Even, Caroline

Abstract

Evacuation planning and scheduling is a critical aspect of disaster management and national security applications. This paper proposes a conflict-based path-generation approach for evacuation planning. Its key idea is to decompose the evacuation planning problem into a master and a subproblem. The subproblem generates new evacuation paths for each evacuated area, while the master problem optimizes the flow of evacuees and produce an evacuation plan. Each new path is generated to remedy conflicts in the evacuation flows and adds new columns and a new row in the master problem. The algorithm is applied to a set of large-scale evacuation scenarios ranging from the Hawkesbury-Nepean flood plain (West Sydney, Australia) which require evacuating in the order of 70,000 persons, to the New Orleans metropolitan area and its 1,000,000 residents. Experiments illustrate the scalability of the approach which is able to produce evacuation for scenarios with more than 1200 nodes, while a direct Mixed Integer Programming formulation becomes intractable for instances with more than 5 nodes. With this approach, realistic evacuations scenarios can be solved near-optimally in reasonable time, supporting both evacuation planning in strategic, tactical, and operational environments.

Suggested Citation

  • Pillac, Victor & Van Hentenryck, Pascal & Even, Caroline, 2016. "A conflict-based path-generation heuristic for evacuation planning," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 136-150.
    • Handle: RePEc:eee:transb:v:83:y:2016:i:c:p:136-150
    DOI: 10.1016/j.trb.2015.09.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261515002027
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2015.09.008?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. Daniel Fonseca & Gary Moynihan & Huston Fernandes, 2011. "The Role of Non-Recurring Congestion in Massive Hurricane Evacuation Events," Chapters, in: Anthony Rocco Lupo (ed.), Recent Hurricane Research - Climate, Dynamics, and Societal Impacts, IntechOpen.
    2. Bish, Douglas R. & Sherali, Hanif D., 2013. "Aggregate-level demand management in evacuation planning," European Journal of Operational Research, Elsevier, vol. 224(1), pages 79-92.
    3. Kaj Holmberg & Di Yuan, 2003. "A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 42-57, February.
    4. Lim, Gino J. & Zangeneh, Shabnam & Reza Baharnemati, M. & Assavapokee, Tiravat, 2012. "A capacitated network flow optimization approach for short notice evacuation planning," European Journal of Operational Research, Elsevier, vol. 223(1), pages 234-245.
    5. Bretschneider, S. & Kimms, A., 2011. "A basic mathematical model for evacuation problems in urban areas," Transportation Research Part A: Policy and Practice, Elsevier, vol. 45(6), pages 523-539, July.
    6. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    7. Cynthia Barnhart & Christopher A. Hane & Pamela H. Vance, 2000. "Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems," Operations Research, INFORMS, vol. 48(2), pages 318-326, April.
    8. Daganzo, Carlos F., 1994. "The cell transmission model: A dynamic representation of highway traffic consistent with the hydrodynamic theory," Transportation Research Part B: Methodological, Elsevier, vol. 28(4), pages 269-287, August.
    9. Bretschneider, S. & Kimms, A., 2012. "Pattern-based evacuation planning for urban areas," European Journal of Operational Research, Elsevier, vol. 216(1), pages 57-69.
    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. Bian Liang & Dapeng Yang & Xinghong Qin & Teresa Tinta, 2019. "A Risk-Averse Shelter Location and Evacuation Routing Assignment Problem in an Uncertain Environment," IJERPH, MDPI, vol. 16(20), pages 1-28, October.
    2. Wu, Wen-Xiang & Huang, Hai-Jun, 2019. "A combined, adaptive strategy for managing evacuation routes," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 182-198.
    3. Cui, Geng & Yanagisawa, Daichi & Nishinari, Katsuhiro, 2021. "Incorporating genetic algorithm to optimise initial condition of pedestrian evacuation based on agent aggressiveness," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 583(C).
    4. Wang, Yan & Wang, Junwei, 2019. "Integrated reconfiguration of both supply and demand for evacuation planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 130(C), pages 82-94.
    5. Krutein, Klaas Fiete & Goodchild, Anne, 2022. "The isolated community evacuation problem with mixed integer programming," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    6. Inmaculada Flores & M. Teresa Ortuño & Gregorio Tirado & Begoña Vitoriano, 2020. "Supported Evacuation for Disaster Relief through Lexicographic Goal Programming," Mathematics, MDPI, vol. 8(4), pages 1-20, April.
    7. Xuefen Liu & Samsung Lim, 2018. "An agent-based evacuation model for the 2011 Brisbane City-scale riverine flood," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 94(1), pages 53-70, October.
    8. Jin, Jian Gang & Shen, Yifan & Hu, Hao & Fan, Yiqun & Yu, Mingjian, 2021. "Optimizing underground shelter location and mass pedestrian evacuation in urban community areas: A case study of Shanghai," Transportation Research Part A: Policy and Practice, Elsevier, vol. 149(C), pages 124-138.
    9. Xinhua Mao & Changwei Yuan & Jiahua Gan & Jibiao Zhou, 2019. "Optimal Evacuation Strategy for Parking Lots Considering the Dynamic Background Traffic Flows," IJERPH, MDPI, vol. 16(12), pages 1-20, June.
    10. Bayram, Vedat & Yaman, Hande, 2024. "A joint demand and supply management approach to large scale urban evacuation planning: Evacuate or shelter-in-place, staging and dynamic resource allocation," European Journal of Operational Research, Elsevier, vol. 313(1), pages 171-191.

    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. Bayram, Vedat & Yaman, Hande, 2024. "A joint demand and supply management approach to large scale urban evacuation planning: Evacuate or shelter-in-place, staging and dynamic resource allocation," European Journal of Operational Research, Elsevier, vol. 313(1), pages 171-191.
    2. Melissa Gama & Bruno Filipe Santos & Maria Paola Scaparra, 2016. "A multi-period shelter location-allocation model with evacuation orders for flood disasters," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(3), pages 299-323, September.
    3. Kimms, A. & Maiwald, M., 2018. "Bi-objective safe and resilient urban evacuation planning," European Journal of Operational Research, Elsevier, vol. 269(3), pages 1122-1136.
    4. Fry, John & Binner, Jane M., 2016. "Elementary modelling and behavioural analysis for emergency evacuations using social media," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1014-1023.
    5. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    6. Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
    7. Hela Masri & Saoussen Krichen, 2018. "Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem," Annals of Operations Research, Springer, vol. 267(1), pages 353-377, August.
    8. 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.
    9. Zhixing Luo & Hu Qin & T. C. E. Cheng & Qinghua Wu & Andrew Lim, 2021. "A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 452-476, May.
    10. Barış Yıldız & Oya Ekin Karaşan, 2017. "Regenerator Location Problem in Flexible Optical Networks," Operations Research, INFORMS, vol. 65(3), pages 595-620, June.
    11. Karabuk, Suleyman & Manzour, Hasan, 2019. "A multi-stage stochastic program for evacuation management under tornado track uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 124(C), pages 128-151.
    12. Gamvros, Ioannis & Raghavan, S., 2012. "Multi-period traffic routing in satellite networks," European Journal of Operational Research, Elsevier, vol. 219(3), pages 738-750.
    13. Hadi W. Purnomo & Jonathan F. Bard, 2007. "Cyclic preference scheduling for nurses using branch and price," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 200-220, March.
    14. Xuedong Yan & Xiaobing Liu & Yulei Song, 2018. "Optimizing evacuation efficiency under emergency with consideration of social fairness based on a cell transmission model," PLOS ONE, Public Library of Science, vol. 13(11), pages 1-21, November.
    15. Khodakaram Salimifard & Sara Bigharaz, 2022. "The multicommodity network flow problem: state of the art classification, applications, and solution methods," Operational Research, Springer, vol. 22(1), pages 1-47, March.
    16. Jiang-Hua Zhang & Hai-Yue Liu & Rui Zhu & Yang Liu, 2017. "Emergency Evacuation of Hazardous Chemical Accidents Based on Diffusion Simulation," Complexity, Hindawi, vol. 2017, pages 1-16, December.
    17. Li, Xiangyong & Wei, Kai & Guo, Zhaoxia & Wang, Wei & Aneja, Y.P., 2021. "An exact approach for the service network design problem with heterogeneous resource constraints," Omega, Elsevier, vol. 102(C).
    18. Zhixing Luo & Hu Qin & Wenbin Zhu & Andrew Lim, 2017. "Branch and Price and Cut for the Split-Delivery Vehicle Routing Problem with Time Windows and Linear Weight-Related Cost," Transportation Science, INFORMS, vol. 51(2), pages 668-687, May.
    19. Jans, Raf, 2010. "Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems," European Journal of Operational Research, Elsevier, vol. 204(2), pages 251-254, July.
    20. Bita Tadayon & J. Cole Smith, 2014. "Algorithms for an Integer Multicommodity Network Flow Problem with Node Reliability Considerations," Journal of Optimization Theory and Applications, Springer, vol. 161(2), pages 506-532, May.

    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:transb:v:83:y:2016:i:c:p:136-150. 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/wps/find/journaldescription.cws_home/548/description#description .

    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.