Abstract
When an underground mall is flooded, the shoppers should be evacuated to a building connected to the mall. However, the number of evacuees from a large-scale underground mall will exceed the capacity of the evacuation center. Furthermore, the evacuation time may be delayed. This paper proposes a mathematical programming problem that minimizes the evacuation completion time on a general planar graph of a partitioned evacuation area with a specified sink capacity. We also propose a workflow for translating the general geometric spatial data to graphical data. The problem is applied to the real spatial data and evacuation setting of Umeda underground mall in Osaka, Japan. The problem’s performance is compared with that of the conventional problem that minimizes the total evacuation distance, and its accuracy is confirmed in a multi-agent simulation. The validity of the proposed method is also discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
