美国数学建模竞赛特等奖论文——2001 B O Project H.E.R.O. Hurricane Evacuation Route Optimization【数学建模】.pdfVIP

Project H.E.R.O. 257 Project H.E.R.O.: Hurricane Evacuation Route Optimization Nathan Gossett Barbara Hess Michael Page Bethel College St. Paul, MN Advisor: William M. Kinney Introduction Through modeling and computer simulation, we established an evacuation plan for the coastal region of South Carolina in the event of an evacuation order. We derive nine evacuation routes running from the coastal region inland. Based on geography, counties are given access to appropriate routes. Com- bining flow theory with geographic, demographic, and time constraints, we formulate a maximum flow problem. Using linear optimization, we find a fea- sible solution. This solution serves as a basis for our evacuation model. The validity of the model is confirmed through computer simulation. A total evacuation (1.1 million people) in 24 to 26 hours is possible only if all traffic is reversed on the nine evacuation routes. Terms and Definitions Flow F : the number of cars that pass a given point per unit time (cars per hour per lane, unless otherwise specified). Speed s: the rate of movement of a single car (mph, unless otherwise specified). Density k: the number of cars per unit length of roadway (cars per mile per lane, unless otherwise specified). c The UMAP Journal 22 (3) (2001) 257ñ269. Copyright 2001 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 be honored. To copy otherwise, to republish, to post on servers, or to redistribute to lists requires prior permission from COMAP.