Buradasınız

Anasayfa » Content

Basic principle for the solution of the building evacuation problem

Journal Name:

  • Journal of Industrial Engineering and Management

Publication Year:

  • 2009
DOI: 
doi:10.3926/jiem.2009.v2n3.p499-516

Key Words:

Author NameUniversity of Author
Abstract (2. Language): 
Abstract: Nowadays, there exist different offers to find the solution of the building evacuation problem. As we analyze in the state of the art, this problem can be studied from different perspectives and even as a problem of optimization considering different objectives. We can wonder on which is the most suitable formulation and the response can be as confusing as saying that it depends on our aims. The more important things to study the ideal building evacuation, understood as the distribution of the occupants towards the exits that achieves the minimal evacuation time, are the valid principles for any formulation of the problem. One of them appears in the present work. To expose the principle, we use graphical procedures that are applied to the optimization of the enclosure evacuation. In the exposed procedure, speeds and constant flows of traffic are considered to model the movement of the persons. Ways and possible delays in the beginning of the bulging evacuation are studied.
Bookmark/Search this post with
FULL TEXT (PDF): 
PDF icon arastirmax-basic-principle-solution-building-evacuation-problem.pdf
  • 3
499-516
  • English

REFERENCES

References: 

Berlin, G. N., (1980). A network analysis of building egress system. ORSA/TIMS meeting Washington.
Brown, J. R. (1979). The knapsack sharing problem. Operation Research, 27(2), 340-355.
Choi, W., Hamacher, S., & Tufekci, S. (1988). Modelling of building evacuation problems by network flows with side constraints. European Journal of Operational Research, 35, 98-110.
Francis, R. L. (1979). A simple graphical procedure to estimate the minimum time to evacuate a building. Society of Fire Protection Engineers, Technology Report 1979-5, 14 p.
Francis, R. L. (1981). A 'Uniformity principle' for evacuation route allocation. Journal of Research of National Bureau of Standards, 86, 509-513.
Francis, R. L., Chalmet, L. G., & Saunders, P. B. (1982). Network models for building evacuation. Management Science, 28, 86-105.
Francis, R. L., & Kisko, T. M. (1984). Network models of building evacuation: Development of software system. Grant No. NB81NADA2057, 62 p.
Francis, R. L., & Kisko, T. M. (1985). EVACNET+: A Computer program to determine Optimal building evacuation plans. Fire Safety Journal, 9, 211-220.
Fruins, J. J. (1971-1987). Pedestrian planning and design. Library of Congress Catalogue Number 70-159312: Elevator World.
Galea, E. R., & Galparsoro, J. M. P. (1993). Exodus: An evacuation model Mass Transport Vehicles. London: UK CAA paper 93006.
doi:10.3926/jiem.2009.v2n3.p499-516 ©© JIEM, 2009 – 2(3): 499-516 - ISSN: 2013-0953
Basic principle for the solution of the building evacuation problem 513
S. Casadesús Pursals; F. Garriga Garzón
Galea, E. R., & Galparsoro, J. M .P. (1994). A computer based simulation model for the prediction of evacuation from mass transport vehicles. Fire Safety Journal, 22, 341-366.
Galea, E. R., Gwinne, S., Lawrence, P., & Filipidis, L. (2001). Modeling occupant interaction with fire conditions using the building EXODUS evacuation model. Fire Safety Journal, 36(4), 327-357.
Getachew, T. (1992). An algorithm for multiple-objective path optimization with time dependent links. Paper presented at the 10th International conference on multi-criteria decision making.
Getachew, T., Kostreva M., & Lancaster L. (2000). A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks. RAIRO Operation Research, 34, 27-47.
Gupta, A. K., & Yadav, P. K. (2004). SAFE-R: a new model to study the evacuation profile of a building. Fire Safety Journal, 39, 539-556.
Hope, B., & Tardos, E. (1994). Polynomial time algorithms for some evacuations problems, Paper presented at the Fifth Annual SIAM Symposium on Discrete Algorithms.
Hope, B., & Tardos, E. (1995). The Quickest Transshipment Problem. Paper presented at the 6th Annual SIAM Symposium on Discrete Algorithms.
Kholshenikov, V. V., Shields, T. H., Boyce, K. E., & Samoshin, D. A. (2006). Recent developments in pedestrian flow theory and Research in Russia. Fire Safety Journal, 43, 108-118.
Kostreva, M. M., & Getachew, T. (1991). Optimization models in fire egress analysis for residential buildings Paper presented at the Third International Symposium (Elsevier Applied Science).
Lin, P., Lo, S. M., Huang, H. C., & Yuen, K. K. (2008). On the use of multi stage time-varying quickest time approach for optimization of evacuation planning (Department of Building & Construction, City University of Hong Kong, Hong Kong). Fire Safety Journal, 43, 282-290.
doi:10.3926/jiem.2009.v2n3.p499-516 ©© JIEM, 2009 – 2(3): 499-516 - ISSN: 2013-0953
Basic principle for the solution of the building evacuation problem 514
S. Casadesús Pursals; F. Garriga Garzón
Lo, S. M., & Fang, Z. (2000). A Spatial-Grid Evacuation Model for Buildings. Journal of Fire Science, 18, 376-394.
Lo, S. M., Huang, H. C., Wang, P., & Yuen, K. K. (2006). A game theory based exit selection model for evacuation (8Fire Safety and Disaster Prevention Group, Department of Building & Construction, City University of Hong Kong, Hong Kong). Fire Safety Journal, 41, 364-369.
London Transport Board (1958). Second Report of the Operational Research Team on the Capacity of Footways. London: London Transport Board.
Lovas, G. G., Wiklund, J., & Drager,H. (1992). Evacuation models and objectives. Paper presented at the 1992 Emergency Management and Engineering Conference: Managing Risk with Computer Simulation. Society for Computer Simulation.
Lovas, G. G. (1995). On performance measures for evacuation systems. European Journal of Operational Research, 85, 352-367.
Lovas, G. G. (1998). Models of way finding in emergency evacuations. European Journal of Operational Research, 105, 371-389.
Lu, Q., Huang, Y., & Shekhar, S. (2003). Evacuation Planning: A Capacity Constrained Routing Approach. Department of Computer Science and Engineering (University of Minnesota, Minneapolis, USA), 111-125.
Lu, Q., Huamng, Y., & Shekhar, S. (2003). Evacuation Planning: A Capacity Constrained Routing Approach. Department of Computer Science and Engineering (University of Minnesota, Minneapolis, USA), 11 p.
Lu, Q., George, B., & Shekhar, S. (2005). Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results. Working paper, 291-307
Megiddo, N. (1974). Optimal Flow in Networks with Multiple Sources and Sinks. Mathematical Programming, 7, 97-107.
Megiddo, N. (1979). Combinatorial Optimization with Rational Objective Functions. Mathematics and Operation Research, 4, 414-424.
doi:10.3926/jiem.2009.v2n3.p499-516 ©© JIEM, 2009 – 2(3): 499-516 - ISSN: 2013-0953
Basic principle for the solution of the building evacuation problem 515
S. Casadesús Pursals; F. Garriga Garzón
Melinek, S. J., & Booth, S. (1975). An analysis of evacuation times and movement of crowds in buildings. Building Research Establishment, CP 96/75.
Minieka, J. L. (1973). Maximal, Lexicographic and Dynamic Network Flows. Operation Research, 12(2), 517-527.
Nelson, H. E., & McLennan, H. A. (1996). Emergency Movement. In The SFPE Handbook of Fire Protection Engineering. Section 3/Chapter 14 (pp. 3.286-3.295). Natl Fire Protection Assn.
Pauls, J. L., & Jones B. K. (1980). Building Evacuation: Research Methods and case Studies. Fires and Human Behavior, 227-251.
Pauls, J. L. (1984). The movement of people in buildings and design solutions for means of egress. Fire Technology, 20(1), 27-.
Pauls, J. L. (1996). Movement of people. In The SFPE Handbook of Fire Protection Engineering, Section 3/Chapter 12 (3-263/3-285). Natl Fire Protection Assn.
Predtechenskii, W. M., & Milinskii, A. I. (1969-1978). Planning for foot traffic flow in buildings, Amerind Publishing Co. New Delhi, National Bureau of Standards, U.S. Dep. Commerce, PB-294 993-T, 238 p.
Resier, M. (1978). Mean Value Analysis of Queuing Network Models: A new look at an old problem. Yorktown: IBM Research Report.
Resier, M., & Lavenberg, S. (1980). Mean Value Analysis of Queuing Network Models. JACM, 27, 313-322
Smith, J. M., & Karbowicz, C. J. (1984). A K-shortest paths routing heuristic for stochastic network evacuation models. Engineering Optimization, 7, 253-280.
Smith, J. M., & Talebi, K. (1985). Stochastic network evacuation models. Computers & Operations Research, 12(6), 559-577.
Smith, J. M., & Bakuli, D. (1996). Resource allocation in state dependent emergency evacuation networks. European Journal of Operation Research, 89, 543-555.
doi:10.3926/jiem.2009.v2n3.p499-516 ©© JIEM, 2009 – 2(3): 499-516 - ISSN: 2013-0953
Basic principle for the solution of the building evacuation problem 516
S. Casadesús Pursals; F. Garriga Garzón
Togawa, K. (1955). Study of fire escape based on the observation multitude currents. Japan Building Research Institute, Report 55-14.
Thompson, P. A., & Marchant, E. W. (1995). A computer model for the evacuation of large building populations. Fire Safety Journal, 24, 131-148.
Thompson, P. A., & Marchant, E. W. (1995). Testing and application of the computer model SIMULEX. Fire Safety Journal, 24, 149-166.
Tjandra, A. S. (2004). Earliest Arrival Flow with Time Dependent Capacity Approach to the Evacuation Problems. Working paper, 24 p.
Tjandra, A. S. (2003). Dynamic Network Optimization with Application to the Evacuation Problems. PhD thesis at the Technische Universität Kaiserslautern, Kaiserslautern, Germany.
Weinroth, J. (1989). An adaptable microcomputer model for evacuation management. Fire Technology, 291-307.
Wiecek, M. (1992). Multicriteria decision making in fire egress analysis. Workshop at the IFAC/IFORS. Workshop on Support Systems for Decision and Negotiation.
Wiecek, T. (1993). Time dependency in multiple-objective dynamic programming. Journal of Mathematical Analysis and Applications, 173, 289-307.

Thank you for copying data from http://www.arastirmax.com