1981
DOI: 10.6028/jres.086.023
|View full text |Cite
|
Sign up to set email alerts
|

A "Uniformity Principle" for Evacuation Route Allocation

Abstract: This paper establishes what might be called a "uniformity principle" for building evacuation problems. The principle may be stated as follows: given a building for which each occupant has reasonable access to every evacuation route, if the building is evacuated in minimum time, then the allocation of evacuees to routes is such that the route evacuation times are all the same. That is, there is a uniformity of route evacuation times. Also, analytical expressions for the minimum time to evacuate a building, and … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
15
0

Year Published

1982
1982
2015
2015

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 24 publications
(16 citation statements)
references
References 4 publications
1
15
0
Order By: Relevance
“…Contrary to earlier work in this area (see for example Francis [10], Chalmet, Francis and Saunders [4], Choi, Hamacher and Tufecki [6], Hamacher and Tjandra [12], Tjandra [19]) which employed networks primarily in macroscopic settings where building structure is usually greatly abstracted compared to the microscopic settings of evacuation simulations. In contrast to this, our networks are derived from the microscopic settings of cellular automata.…”
Section: Our Approachmentioning
confidence: 90%
“…Contrary to earlier work in this area (see for example Francis [10], Chalmet, Francis and Saunders [4], Choi, Hamacher and Tufecki [6], Hamacher and Tjandra [12], Tjandra [19]) which employed networks primarily in macroscopic settings where building structure is usually greatly abstracted compared to the microscopic settings of evacuation simulations. In contrast to this, our networks are derived from the microscopic settings of cellular automata.…”
Section: Our Approachmentioning
confidence: 90%
“…The notion of "effective length" [7] calculated as the product of the physical length and the hazard intensity, together with Dijkstra's algorithm can compute the best path to exits [16], [17], and can include [18] information about the spatial hazard. The "Uniformity principle" [19] is also useful in showing that proper allocation of evacuees to routes, such that all exit routes have the same clearance time, is essential in minimizing evacuation time [20], while in [21], [22] network flow models mimic evacuation planning problems and convert the original network to time-expended networks. To reduce the high computational cost caused of these linear programming methods, in [23] the Cognitive Packet Network is used for route discovery.…”
Section: Related Workmentioning
confidence: 99%
“…The second category of evacuation studies focused on optimizing the pedestrian evacuation process, mainly deal with the in‐building evacuation scenarios. An early static transshipment network model of building 101 has been widely explored as a benchmark for assessing the applicability of network flow optimization models for in‐building evacuation . Chalmet et al .…”
Section: Literature Reviewmentioning
confidence: 99%
“…Their algorithm allows for joint optimal choice of destinations, routes, and departure times. of building 101 has been widely explored as a benchmark for assessing the applicability of network flow optimization models for in-building evacuation [27]. Chalmet et al [28] expanded it with dynamic formulations that use the procedure of Ford and Fulkerson [29] to concurrently maximize the total number of people evacuating from the building for all periods and to also minimize the duration for the last evacuee to exist the building.…”
Section: Vehicle Evacuation Studiesmentioning
confidence: 99%