Planning evacuation routes with the P-graph framework

Juan C. Garcia-Ojeda, B. Bertók, F. Friedler

Research output: Article

18 Citations (Scopus)

Abstract

The P-graph framework is proven to be highly effective in solving Process Network Synthesis. In the present work, the P-graph framework has been adopted for solving the routing and scheduling of evacuees, facing a life-threatening situation. First the building evacuation problem is represented by means of a P-graph model, which is then transformed into a time-expanded process network synthesis (PNST) problem that can be algorithmically handled by the P-graph framework. In the proposed method, each location in the building and their passages are given by a set of attributes to be taken in the evacuation route planning. In addition to the globally optimal solution of the building evacuation problem, the P-graph framework provides the n-best suboptimal solutions, when computational possible. The viability of the proposed model is illustrated by an example.

Original languageEnglish
Pages (from-to)1531-1536
Number of pages6
JournalChemical Engineering Transactions
Volume29
DOIs
Publication statusPublished - 2012

Fingerprint

Planning
Scheduling

ASJC Scopus subject areas

  • Chemical Engineering(all)

Cite this

Planning evacuation routes with the P-graph framework. / Garcia-Ojeda, Juan C.; Bertók, B.; Friedler, F.

In: Chemical Engineering Transactions, Vol. 29, 2012, p. 1531-1536.

Research output: Article

@article{7b53a91314c04747abf899b375d65121,
title = "Planning evacuation routes with the P-graph framework",
abstract = "The P-graph framework is proven to be highly effective in solving Process Network Synthesis. In the present work, the P-graph framework has been adopted for solving the routing and scheduling of evacuees, facing a life-threatening situation. First the building evacuation problem is represented by means of a P-graph model, which is then transformed into a time-expanded process network synthesis (PNST) problem that can be algorithmically handled by the P-graph framework. In the proposed method, each location in the building and their passages are given by a set of attributes to be taken in the evacuation route planning. In addition to the globally optimal solution of the building evacuation problem, the P-graph framework provides the n-best suboptimal solutions, when computational possible. The viability of the proposed model is illustrated by an example.",
author = "Garcia-Ojeda, {Juan C.} and B. Bert{\'o}k and F. Friedler",
year = "2012",
doi = "10.3303/CET1229256",
language = "English",
volume = "29",
pages = "1531--1536",
journal = "Chemical Engineering Transactions",
issn = "1974-9791",
publisher = "AIDIC-Italian Association of Chemical Engineering",

}

TY - JOUR

T1 - Planning evacuation routes with the P-graph framework

AU - Garcia-Ojeda, Juan C.

AU - Bertók, B.

AU - Friedler, F.

PY - 2012

Y1 - 2012

N2 - The P-graph framework is proven to be highly effective in solving Process Network Synthesis. In the present work, the P-graph framework has been adopted for solving the routing and scheduling of evacuees, facing a life-threatening situation. First the building evacuation problem is represented by means of a P-graph model, which is then transformed into a time-expanded process network synthesis (PNST) problem that can be algorithmically handled by the P-graph framework. In the proposed method, each location in the building and their passages are given by a set of attributes to be taken in the evacuation route planning. In addition to the globally optimal solution of the building evacuation problem, the P-graph framework provides the n-best suboptimal solutions, when computational possible. The viability of the proposed model is illustrated by an example.

AB - The P-graph framework is proven to be highly effective in solving Process Network Synthesis. In the present work, the P-graph framework has been adopted for solving the routing and scheduling of evacuees, facing a life-threatening situation. First the building evacuation problem is represented by means of a P-graph model, which is then transformed into a time-expanded process network synthesis (PNST) problem that can be algorithmically handled by the P-graph framework. In the proposed method, each location in the building and their passages are given by a set of attributes to be taken in the evacuation route planning. In addition to the globally optimal solution of the building evacuation problem, the P-graph framework provides the n-best suboptimal solutions, when computational possible. The viability of the proposed model is illustrated by an example.

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

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

U2 - 10.3303/CET1229256

DO - 10.3303/CET1229256

M3 - Article

AN - SCOPUS:84870784080

VL - 29

SP - 1531

EP - 1536

JO - Chemical Engineering Transactions

JF - Chemical Engineering Transactions

SN - 1974-9791

ER -