Building-evacuation-route planning via time-expanded process-network synthesis

J. C. García-Ojeda, B. Bertok, F. Friedler, L. T. Fan

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

Abstract

A method and software are proposed for optimal building-evacuation-route planning in terms of identifying evacuation routes and scheduling of evacuees on each route. First, the building-evacuation routes are represented by a P-graph, which gives rise to a time-expanded process-network synthesis (PNST) problem that can be algorithmically solved by the P-graph framework. In the proposed method, each location and passage in the building is given by a set of attributes to be taken into account in the evacuation-route planning. The evacuation time is calculated as a minimum cost of the corresponding PN ST. In addition to the globally optimal solution, the P-graph framework provides the n-best sub-optimal solutions. The validity of the proposed method is illustrated by two examples.

Original languageEnglish
Pages (from-to)338-347
Number of pages10
JournalFire Safety Journal
Volume61
DOIs
StatePublished - 2013

Keywords

  • Building evacuation route planning
  • Combinatorial optimization
  • P-graph
  • Process-network synthesis

Fingerprint

Dive into the research topics of 'Building-evacuation-route planning via time-expanded process-network synthesis'. Together they form a unique fingerprint.

Cite this