Network models for building evacuation

Chalmet, L. G.; Francis, Richard L.; Saunders, Patsy B

doi:10.1007/bf02993491

Cited by 80 publications

(21 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Associated emergency navigation algorithms at that time normally used purely mathematical models to simplify an evacuation process and seek optimal solutions. Thus in [31] evacuation planning is considered as a minimum cost network flow problem that converts the original building graph to a time-expanded network. By solving the time-expanded network via a linear programming algorithm, evacuees can obtain optimal routes and achieve shortest evacuation time.…”

Section: A Literature Reviewmentioning

confidence: 99%

Managing Crowds in Hazards With Dynamic Grouping

Akinwande

Gelenbe

2015

IEEE Access

View full text Add to dashboard Cite

Emergency navigation algorithms for evacuees in confined spaces typically treat all evacuees in a homogeneous manner, using a common metric to select the best exit paths. In this paper, we present a quality of service (QoS) driven routing algorithm to cater to the needs of different types of evacuees based on age, mobility, and level of resistance to fatigue and hazard. Spatial information regarding the location and the spread of hazards is also integrated into the routing metrics to avoid situations where evacuees may be directed toward hazardous zones. Furthermore, rather than persisting with a single decision algorithm during an entire evacuation process, we suggest that evacuees may adapt their course of action with regard to their ongoing physical condition and environment. A widely tested routing protocol known as the cognitive packet network with random neural networks and reinforcement learning are employed to collect information and provide advice to evacuees, and is beneficial in emergency navigation owing to its low computational complexity and its ability to handle multiple QoS metrics in its search for safe exit paths. The simulation results indicate that the proposed algorithm, which is sensitive to the needs of evacuees, produces better results than the use of a single metric. Simulations also show that the use of dynamic grouping to adjust the evacuees' category, and routing algorithms that have regard for their on-going health conditions and mobility, can achieve higher survival rates.INDEX TERMS Emergency navigation, QoS driven protocol, dynamic grouping, cognitive packet network, discrete event simulation.

show abstract

Section: A Literature Reviewmentioning

confidence: 99%

Managing Crowds in Hazards With Dynamic Grouping

Akinwande

Gelenbe

2015

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Finalmente, cada corredor (i, j, k) está restringido por el tiempo de desplazamiento, λ(i,j,k), un entero no-negativo que mide el tiempo que una persona requiere para atravesar la longitud entera de un corredor. Es importante mencionar que es 1 (M) representa powerset del conjunto M el experto o grupo de expertos los encargados de especificar cada una de las restricciones mencionadas previamente en el edificio de interés [4,[8][9][10][11][12][13][14][15].…”

Section: Definición Del Problemaunclassified

Identifying evacuation routes via the P-graph methodology

García-Ojeda

Bertok

Friedler

et al. 2015

2015 10th Computing Colombian Conference (10CCC)

View full text Add to dashboard Cite

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.).Resumen-Este trabajo propone un método y software para la identificación y análisis de los planes de rutas de evacuación en edificios. Inicialmente, el plano arquitectónico del edificio se representa mediante P-graphs para facilitar la identificación de las rutas de evacuación. Posteriormente, cada una de estas rutas se transforma en un problema de síntesis de redes de procesos de tiempo expandido (PNST); el cual se resuelve algorítmicamente con base en la metodología P-graph. En el método propuesto, cada ubicación y corredor en el edificio se describe por medio de un conjunto de atributos que debe considerarse en el plan de rutas de evacuación. Finalmente, las rutas de evacuación se organizan con base en el tiempo de evacuación que se calcula como el costo mínimo del correspondiente problema PNST. Además, las rutas de evacuación pueden organizarse según diferentes criterios (e.g., cuellos de botella, utilización de rutas, etc.).

show abstract

“…They can be either time-dependent or time-independent. Being an effective modeling tool for transportation problems, the dynamic network models are also widely used in evacuation problems including: time-expand network with constant parameters [7], minimal cost flow model with side constraints [8], lexicographic minimal cost flow model [9], earliest arrival flow model [10], integral time-dependent quickest flow model [11] and polynomial-time approximation scheme model [12]. In practice, most of the current optimization approaches are based on static networks or timeindependent dynamic networks.…”

Section: Cg Based Applicationsmentioning

confidence: 99%

Research of crisis management system based on CG and GIS

Zhan

Yuen

2011

2011 IEEE International Conference on Computer Science and Automation Engineering

View full text Add to dashboard Cite

This paper presents a novel software model for public crisis management system in the modern city. Urban emergency such as various hazards will result in serious casualties and property loss. With the development of information technology, scientific crisis management system aided by computers should be constructed to mitigate the disasters. On the one hand, the application of Computer Graphics (CG) and Geographic Information System (GIS) for urban crisis management system is discussed. On the other hand, the integration of CG and GIS in the field of emergency management is proposed for the reference of government agencies.

show abstract

Network models for building evacuation

Cited by 80 publications

References 18 publications

Managing Crowds in Hazards With Dynamic Grouping

Managing Crowds in Hazards With Dynamic Grouping

Identifying evacuation routes via the P-graph methodology

Research of crisis management system based on CG and GIS

Contact Info

Product

Resources

About