IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v55y2008i4p363-376.html
   My bibliography  Save this article

The building evacuation problem with shared information

Author

Listed:
  • Lichun Chen
  • Elise Miller‐Hooks

Abstract

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008

Suggested Citation

  • Lichun Chen & Elise Miller‐Hooks, 2008. "The building evacuation problem with shared information," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(4), pages 363-376, June.
  • Handle: RePEc:wly:navres:v:55:y:2008:i:4:p:363-376
    DOI: 10.1002/nav.20288
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20288
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nav.20288?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
    ---><---

    References listed on IDEAS

    as
    1. DINITZ, Yefim & GARG, Naveen & GOEMANS, Michel X., 1999. "On the single-source unsplittable flow problem," LIDAM Reprints CORE 1433, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Dirk Helbing & Illés Farkas & Tamás Vicsek, 2000. "Simulating dynamical features of escape panic," Nature, Nature, vol. 407(6803), pages 487-490, September.
    3. John J. Jarvis & H. Donald Ratliff, 1982. "Note---Some Equivalent Objectives for Dynamic Network Flow Problems," Management Science, INFORMS, vol. 28(1), pages 106-109, January.
    4. 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.
    5. T. L. Magnanti & R. T. Wong, 1981. "Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria," Operations Research, INFORMS, vol. 29(3), pages 464-484, June.
    6. Jean-François Cordeau & François Soumis & Jacques Desrosiers, 2000. "A Benders Decomposition Approach for the Locomotive and Car Assignment Problem," Transportation Science, INFORMS, vol. 34(2), pages 133-149, May.
    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. 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.
    2. Douglas Bish & Esra Agca & Roger Glick, 2014. "Decision support for hospital evacuation and emergency response," Annals of Operations Research, Springer, vol. 221(1), pages 89-106, October.
    3. Urmila Pyakurel & Hari Nandan Nath & Stephan Dempe & Tanka Nath Dhamala, 2019. "Efficient Dynamic Flow Algorithms for Evacuation Planning Problems with Partial Lane Reversal," Mathematics, MDPI, vol. 7(10), pages 1-29, October.
    4. 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.

    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. Roni, Md.S. & Eksioglu, Sandra D. & Searcy, Erin & Jha, Krishna, 2014. "A supply chain network design model for biomass co-firing in coal-fired power plants," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 115-134.
    2. Azad, Nader & Hassini, Elkafi, 2019. "Recovery strategies from major supply disruptions in single and multiple sourcing networks," European Journal of Operational Research, Elsevier, vol. 275(2), pages 481-501.
    3. Georgios Saharidis & Marianthi Ierapetritou, 2013. "Speed-up Benders decomposition using maximum density cut (MDC) generation," Annals of Operations Research, Springer, vol. 210(1), pages 101-123, November.
    4. H. W. Hamacher & S. Tufekci, 1987. "On the use of lexicographic min cost flows in evacuation modeling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(4), pages 487-503, August.
    5. Fausto Errico & Teodor Gabriel Crainic & Federico Malucelli & Maddalena Nonato, 2017. "A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems," Transportation Science, INFORMS, vol. 51(2), pages 706-722, May.
    6. Wang, Pengfei & Guan, Hongzhi & Liu, Peng, 2020. "Modeling and solving the optimal allocation-pricing of public parking resources problem in urban-scale network," Transportation Research Part B: Methodological, Elsevier, vol. 137(C), pages 74-98.
    7. Ivan Contreras & Jean-François Cordeau & Gilbert Laporte, 2011. "Benders Decomposition for Large-Scale Uncapacitated Hub Location," Operations Research, INFORMS, vol. 59(6), pages 1477-1490, December.
    8. 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.
    9. Huibo Bi, 2014. "Routing Diverse Evacuees with the Cognitive Packet Network Algorithm," Future Internet, MDPI, vol. 6(2), pages 1-20, April.
    10. Christian Va Karsten & Stefan Ropke & David Pisinger, 2018. "Simultaneous Optimization of Container Ship Sailing Speed and Container Routing with Transit Time Restrictions," Transportation Science, INFORMS, vol. 52(4), pages 769-787, August.
    11. Wada, Kentaro & Akamatsu, Takashi, 2013. "A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 94-112.
    12. Camilo Ortiz-Astorquiza & Jean-François Cordeau & Emma Frejinger, 2021. "The Locomotive Assignment Problem with Distributed Power at the Canadian National Railway Company," Transportation Science, INFORMS, vol. 55(2), pages 510-531, March.
    13. Bernardes Real, Luiza & O'Kelly, Morton & de Miranda, Gilberto & Saraiva de Camargo, Ricardo, 2018. "The gateway hub location problem," Journal of Air Transport Management, Elsevier, vol. 73(C), pages 95-112.
    14. M. Jenabi & S. Fatemi Ghomi & S. Torabi & S. Hosseinian, 2015. "Acceleration strategies of Benders decomposition for the security constraints power system expansion planning," Annals of Operations Research, Springer, vol. 235(1), pages 337-369, December.
    15. Nadine Baumann & Martin Skutella, 2009. "Earliest Arrival Flows with Multiple Sources," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 499-512, May.
    16. Nader Azad & Georgios Saharidis & Hamid Davoudpour & Hooman Malekly & Seyed Yektamaram, 2013. "Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach," Annals of Operations Research, Springer, vol. 210(1), pages 125-163, November.
    17. 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.
    18. Vedat Bayram & Hande Yaman, 2018. "Shelter Location and Evacuation Route Assignment Under Uncertainty: A Benders Decomposition Approach," Transportation Science, INFORMS, vol. 52(2), pages 416-436, March.
    19. Li, Maosheng & Shu, Panpan & Xiao, Yao & Wang, Pu, 2021. "Modeling detour decision combined the tactical and operational layer based on perceived density," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 574(C).
    20. Douglas Bish & Esra Agca & Roger Glick, 2014. "Decision support for hospital evacuation and emergency response," Annals of Operations Research, Springer, vol. 221(1), pages 89-106, October.

    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:wly:navres:v:55:y:2008:i:4:p:363-376. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.