Network models for building evacuation

How can a large building with many occupants be evacuated in minimum time, and where are the bottlenecks likely to occur in such an evacuation? In order to address this question, three network building evacuation models have been presented. It is believed that the models provide useful new tools for the analysis of building evacuability, and have the potential to facilitate the study of the interrelationships with building design, building redesign, and building evacuability.

[1]  John Archea,et al.  An assessment of the technical literature on emergency egress from buildings , 1977 .

[2]  William L. Maxwell,et al.  Dynamic Network Flow Modelling of Fixed Path Material Handling Systems , 1981 .

[3]  A. Williams.  Marginal Values in Linear Programming , 1963 .

[4]  L. Y. Cooper.  Estimating safe available egress time from fires , 1981 .

[5]  Richard L. Francis,et al.  EVACNET: Prototype Network Optimization Models for Building Evacuation. | NIST , 1979 .

[6]  John J. Fruin,et al.  Pedestrian planning and design , 1971 .

[7]  G. N. Berlin,et al.  A system for describing the expected hazards of building fires , 1980 .

[8]  J. Randall Brown,et al.  The Sharing Problem , 1979, Oper. Res..

[9]  George L. Nemhauser,et al.  Optimality Conditions for a Dynamic Traffic Assignment Model , 1978 .

[10]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[11]  W. L. Wilkinson,et al.  An Algorithm for Universal Maximal Dynamic Flows in a Network , 1971, Oper. Res..

[12]  William W. White,et al.  Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers , 1972, Networks.

[13]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[14]  Deepak K. Merchant,et al.  A Model and an Algorithm for the Dynamic Traffic Assignment Problems , 1978 .

[15]  Geoffrey N. Berlin,et al.  The use of directed routes for assessing escape potential , 1978 .

[16]  H. D. Ratliff,et al.  Note—Some Equivalent Objectives for Dynamic Network Flow Problems , 1982 .

[17]  Jonathan Halpern,et al.  A generalized dynamic flows problem , 1979, Networks.

[18]  I A Benjamin,et al.  Control of Smoke Movement in Buildings: A Review. Final Report. | NIST , 1977 .

[19]  H. D. Ratliff,et al.  Scheduling Rules for Parallel Processors , 1977 .

[20]  W. L. Wilkinson,et al.  Min/max bounds for dynamic network flows , 1973 .

[21]  Richard L. Francis,et al.  A "Uniformity Principle" for Evacuation Route Allocation. , 1981, Journal of research of the National Bureau of Standards.

[22]  Richard L. Francis,et al.  Network models for building evacuation , 1982 .

[23]  J. Randall Brown,et al.  The Knapsack Sharing Problem , 1979, Oper. Res..

[24]  Gerald G. Brown,et al.  Design and Implementation of Large-Scale Primal Transshipment Algorithms , 1976 .

[25]  Stephen E. Jacobsen,et al.  On Marginal Allocation in Single Constraint Min-Max Problems , 1971 .

[26]  Evan L. Porteus,et al.  More on Min-Max Allocation , 1972 .

[27]  Edward Minieka,et al.  Maximal, Lexicographic, and Dynamic Network Flows , 1973, Oper. Res..