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

J. C. García-Ojeda, B. Bertók, F. Friedler, L. T. Fan

Research output: Contribution to journalArticle

11 Citations (Scopus)

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
Publication statusPublished - 2013

Fingerprint

network synthesis
planning
routes
Planning
Scheduling
scheduling
Costs
costs
computer programs

Keywords

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

ASJC Scopus subject areas

  • Safety, Risk, Reliability and Quality
  • Chemistry(all)
  • Physics and Astronomy(all)
  • Materials Science(all)

Cite this

Building-evacuation-route planning via time-expanded process-network synthesis. / García-Ojeda, J. C.; Bertók, B.; Friedler, F.; Fan, L. T.

In: Fire Safety Journal, Vol. 61, 2013, p. 338-347.

Research output: Contribution to journalArticle

@article{da309e4fe30a4eaa860c4314f9f86e05,
title = "Building-evacuation-route planning via time-expanded process-network synthesis",
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.",
keywords = "Building evacuation route planning, Combinatorial optimization, P-graph, Process-network synthesis",
author = "Garc{\'i}a-Ojeda, {J. C.} and B. Bert{\'o}k and F. Friedler and Fan, {L. T.}",
year = "2013",
doi = "10.1016/j.firesaf.2013.09.023",
language = "English",
volume = "61",
pages = "338--347",
journal = "Fire Safety Journal",
issn = "0379-7112",
publisher = "Elsevier Limited",

}

TY - JOUR

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

AU - García-Ojeda, J. C.

AU - Bertók, B.

AU - Friedler, F.

AU - Fan, L. T.

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - Building evacuation route planning

KW - Combinatorial optimization

KW - P-graph

KW - Process-network synthesis

UR - http://www.scopus.com/inward/record.url?scp=84886725433&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84886725433&partnerID=8YFLogxK

U2 - 10.1016/j.firesaf.2013.09.023

DO - 10.1016/j.firesaf.2013.09.023

M3 - Article

AN - SCOPUS:84886725433

VL - 61

SP - 338

EP - 347

JO - Fire Safety Journal

JF - Fire Safety Journal

SN - 0379-7112

ER -