Identificando Rutas de Evacuación Empleando el Método P-graph

Translated title of the contribution: Identifying evacuation routes via the P-graph methodology

Juan C. García-Ojeda, B. Bertók, F. Friedler, Andrés Argoti

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this work, we propose a method and its concomitant software for the identification and assessment of building-evacuation routes. First, the building floor map is represented via P-graphs, thereby facilitating the identification of the evacuation routes. Second, each route identified is transformed into a time-expanded, process-network synthesis (PNSt) problem, which can be algorithmically solved by the P-graph methodology. In the proposed method, each location and passage in the building is defined by a set of attributes to be taken into account in the evacuation-route planning. Third, the evacuation routes are ranked in terms of the evacuation time computed as the minimum cost of the corresponding PNSt problem. Furthermore, the evacuation routes can be ranked according to specific criteria (e.g., bottlenecks, route utilization, etc.).

Original languageSpanish
Title of host publication2015 10th Colombian Computing Conference, 10CCC 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages339-346
Number of pages8
ISBN (Print)9781467394642
DOIs
Publication statusPublished - Nov 20 2015
Event10th Colombian Computing Conference, 10CCC 2015 - Bogota, Colombia
Duration: Sep 21 2015Sep 25 2015

Other

Other
CountryColombia
CityBogota
Period9/21/159/25/15

Fingerprint

Planning
Costs

Keywords

  • building-evacuation routes
  • combinatorial optimization
  • P-graph
  • process-network synthesis

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

García-Ojeda, J. C., Bertók, B., Friedler, F., & Argoti, A. (2015). Identificando Rutas de Evacuación Empleando el Método P-graph. In 2015 10th Colombian Computing Conference, 10CCC 2015 (pp. 339-346). [7333443] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ColumbianCC.2015.7333443

Identificando Rutas de Evacuación Empleando el Método P-graph. / García-Ojeda, Juan C.; Bertók, B.; Friedler, F.; Argoti, Andrés.

2015 10th Colombian Computing Conference, 10CCC 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 339-346 7333443.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

García-Ojeda, JC, Bertók, B, Friedler, F & Argoti, A 2015, Identificando Rutas de Evacuación Empleando el Método P-graph. in 2015 10th Colombian Computing Conference, 10CCC 2015., 7333443, Institute of Electrical and Electronics Engineers Inc., pp. 339-346, Bogota, Colombia, 9/21/15. https://doi.org/10.1109/ColumbianCC.2015.7333443
García-Ojeda JC, Bertók B, Friedler F, Argoti A. Identificando Rutas de Evacuación Empleando el Método P-graph. In 2015 10th Colombian Computing Conference, 10CCC 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 339-346. 7333443 https://doi.org/10.1109/ColumbianCC.2015.7333443
García-Ojeda, Juan C. ; Bertók, B. ; Friedler, F. ; Argoti, Andrés. / Identificando Rutas de Evacuación Empleando el Método P-graph. 2015 10th Colombian Computing Conference, 10CCC 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 339-346
@inproceedings{0ebad69337e04fb9af36c5a5fac124ac,
title = "Identificando Rutas de Evacuaci{\'o}n Empleando el M{\'e}todo P-graph",
abstract = "In this work, we propose a method and its concomitant software for the identification and assessment of building-evacuation routes. First, the building floor map is represented via P-graphs, thereby facilitating the identification of the evacuation routes. Second, each route identified is transformed into a time-expanded, process-network synthesis (PNSt) problem, which can be algorithmically solved by the P-graph methodology. In the proposed method, each location and passage in the building is defined by a set of attributes to be taken into account in the evacuation-route planning. Third, the evacuation routes are ranked in terms of the evacuation time computed as the minimum cost of the corresponding PNSt problem. Furthermore, the evacuation routes can be ranked according to specific criteria (e.g., bottlenecks, route utilization, etc.).",
keywords = "building-evacuation routes, combinatorial optimization, P-graph, process-network synthesis",
author = "Garc{\'i}a-Ojeda, {Juan C.} and B. Bert{\'o}k and F. Friedler and Andr{\'e}s Argoti",
year = "2015",
month = "11",
day = "20",
doi = "10.1109/ColumbianCC.2015.7333443",
language = "Spanish",
isbn = "9781467394642",
pages = "339--346",
booktitle = "2015 10th Colombian Computing Conference, 10CCC 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Identificando Rutas de Evacuación Empleando el Método P-graph

AU - García-Ojeda, Juan C.

AU - Bertók, B.

AU - Friedler, F.

AU - Argoti, Andrés

PY - 2015/11/20

Y1 - 2015/11/20

N2 - In this work, we propose a method and its concomitant software for the identification and assessment of building-evacuation routes. First, the building floor map is represented via P-graphs, thereby facilitating the identification of the evacuation routes. Second, each route identified is transformed into a time-expanded, process-network synthesis (PNSt) problem, which can be algorithmically solved by the P-graph methodology. In the proposed method, each location and passage in the building is defined by a set of attributes to be taken into account in the evacuation-route planning. Third, the evacuation routes are ranked in terms of the evacuation time computed as the minimum cost of the corresponding PNSt problem. Furthermore, the evacuation routes can be ranked according to specific criteria (e.g., bottlenecks, route utilization, etc.).

AB - In this work, we propose a method and its concomitant software for the identification and assessment of building-evacuation routes. First, the building floor map is represented via P-graphs, thereby facilitating the identification of the evacuation routes. Second, each route identified is transformed into a time-expanded, process-network synthesis (PNSt) problem, which can be algorithmically solved by the P-graph methodology. In the proposed method, each location and passage in the building is defined by a set of attributes to be taken into account in the evacuation-route planning. Third, the evacuation routes are ranked in terms of the evacuation time computed as the minimum cost of the corresponding PNSt problem. Furthermore, the evacuation routes can be ranked according to specific criteria (e.g., bottlenecks, route utilization, etc.).

KW - building-evacuation routes

KW - combinatorial optimization

KW - P-graph

KW - process-network synthesis

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

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

U2 - 10.1109/ColumbianCC.2015.7333443

DO - 10.1109/ColumbianCC.2015.7333443

M3 - Conference contribution

SN - 9781467394642

SP - 339

EP - 346

BT - 2015 10th Colombian Computing Conference, 10CCC 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -