Emergency search plan for complex premises

Terrorist attacks, natural disasters are on the rise. Land scarcity has forced cities to grow vertically. As a result buildings are becoming a complex environment, posing remarkable challenge for first-responders in emergency situations. Of the most important operations in emergency management is to conduct a timely search of premises. The question of interest is how many firefighters are needed and what are their search plans? Though it is a crucial question, the literature and industry have yet to address it. To this end, we propose a two-phase methodology to draw up the most efficient and timely search plan, called “search map”. In the first phase a minimum number of firefighters is identified. In the second phase, search maps (or routes) for each firefighter are identified. We demonstrate that these two phases have strong resemblances to two famous and quite difficult mathematical problems, namely the “Chinese Postman Problem” and the “Vehicle Routing Problem”. We encode the methodology as two optimization problems which are then solved by two leading optimization software package: GAMS and MATLAB. Numerical results of a large sized floor plan is presented and discussed. The two-phase setup results in an efficient methodology which makes it a suitable tool for addressing real-time emergency responses in rapidly changing indoor environments. The results can be integrated in Building Information Management (BIM) systems and city/building 3D models.

Media Info

  • Pagination: 12p
  • Monograph Title: Australasian Transport Research Forum, 8-10 December 2021, Brisbane, Queensland

Subject/Index Terms

Filing Info

  • Accession Number: 01892372
  • Record Type: Publication
  • Source Agency: ARRB Group Limited
  • Files: ITRD, ATRI
  • Created Date: Sep 6 2023 2:04PM