The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Network Models for Building Evacuation
Abstract
How can a large building with many occupants be evacuated in minimum time, and where are bottlenecks likely to occur in such an evacuation? In order to address this question we have constructed a family of three network building evacuation models. The most general model of interest, called the dynamic model, represents the evacuation of a building as it evolves over time, where time is represented discretely by consecutive time periods. The dynamic model triply optimizes in the sense that while directly minimizing the average over the occupants of the number of periods each needs to exit the building, it simultaneously maximizes the total number of people evacuating the building during periods 1 through p for all values of p, and also minimizes the time period in which the last evacuee exits the building. Coincident with the triple optimization, each arc dual variable indicates whether or not the building component the arc represents is a bottleneck in any period during the evacuation. The other two models in the family, referred to as the graphical model and the intermediate model, are smaller in scope than the dynamic model (they treat time as a parameter and are not time-dependent) but are easier to use, and offer alternative approaches which can provide some of the same insights as the dynamic model. We model the evacuation of an actual eleven floor building with 323 people, four elevators, and two stairwells, and compare model results with results of an observed building evacuation. We believe our 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
A Model and an Algorithm for the Dynamic Traffic Assignment Problems
Merchant, D. K., & Nemhauser, G. L. (1978) · Transportation Science · doi:10.1287/trsc.12.3.183 · Cited by 632
Optimality Conditions for a Dynamic Traffic Assignment Model
Merchant, D. K., & Nemhauser, G. L. (1978) · Transportation Science · doi:10.1287/trsc.12.3.200 · Cited by 324
Brown, J. R. (1979) · Operations Research · doi:10.1287/opre.27.2.324 · Cited by 78
Cited by
A Spatial Access-Oriented Implementation of a 3-D GIS Topological Data Model for Urban Entities
Lee, J. (2004) · GeoInformatica · doi:10.1023/b:gein.0000034820.93914.d0 · Cited by 200
Topology mediates transport of nanoparticles in macromolecular networks
Dai, X., Zhang, X., Gao, L., Xu, Z., & Yan, L.-T. (2022) · Nature Communications · doi:10.1038/s41467-022-31861-9 · Cited by 44
Metadata
- Authors
- Chalmet, L. G., Francis, R. L., & Saunders, P. B.
- Venue
- Management Science
- Published
- 1982-01
- Volume
- 28
- Issue
- 1
- Pages
- 86-105
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2097414563
- Cited by
- 256
- References
- 4
- FWCI
- 15.96
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Network Models for Building Evacuation. https://app.cochat.ai/papers/10.1287/mnsc.28.1.86
- The paper
- Chalmet, L. G., Francis, R. L., & Saunders, P. B. (1982). Network Models for Building Evacuation. Management Science. https://doi.org/10.1287/mnsc.28.1.86
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.