美国数学建模竞赛特等奖论文——1999 B O Room Capacity Analysis Using a Pair of Evacuation Models【数学建模】.pdf

Room Capacity Analysis 321 Room Capacity Analysis Using a Pair of Evacuation Models Gregg A. Christopher Orion Lawler Jason Tedor University of Alaska Fairbanks Fairbanks, AK 99775–6660 Advisor: Chris Hartman Introduction We present two models for determining the amount of time for a given number of people to evacuate a given room. A room’s maximum capacity can be derived from this by imposing a maximum evacuation time, which must take into account factors such as the fire resistance of the room. We develop a graph-based network flow simulation. People are modeled as a compressible fluid that flows toward and out the exit. This model assumes people’s interaction properties, based on industry research. We also develop a discrete particle simulation. People are modeled as disks that attempt to reach the exits. In this model, people’s interaction properties emerge from local, per-person assumptions. We compare and evaluate the models’ outputs and analyze the capacity of several local rooms. Graph Flow Model Overview The graph flow model is a pool-flux model that operates on a graph repre- senting areas of open space within a room. The graph consists of a set of nodes and a set of directed edges . Each node is valued as the number of people in a square patch of floor. Each edge represents the direction of traffic flow from one node to another node. c The UMAP Journal 20 (3) (1999) 321–329. Copyright 1999 by COMAP, Inc. All rights reserved. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice. Abstracting with credit is permitted, but copyrights for components of this work owned by others than COMAP must b