美赛： 特等奖1923074---数学建模.pdf

Team Control Number For office use only For office use only T1 1923074 F1 T2 F2 T3 Problem Chosen F3 T4 F4 D 2019 Interdisciplinary Contest in Modeling (ICM) Summary Sheet (Attach a copy of this page to each copy of your solution paper.) Escape the Louvre Summary On average, more than twenty thousand visitors come to the Louvre Museum each day to admire the precious works of art within. Unfortunately, the reputation of the Louvre also makes it a potential target for terrorist attacks [4]. Under emergency situations like this, all visitors in the museum have to be evacuated as soon as possible. Thus the optimal evacuation routes need to be identified and applied in different scenarios. To solve this problem, we start from the details of specific structures in the Louvre, including stairs, rooms, and doors, constructing several microscopic models to examine the basic proper- ties of these building blocks with professional software. We then represent these structures as nodes and connect them with arcs, forming a macroscopic network model in accordance with the floor plans of the Louvre [6]. Based on the network, we carry out computer simulations to explore the possible routes of evacuation and their efficiency. Our prime target is to minimize the evacuation time, but we first use the Floyd-Warshall Algorithm (Dynamic Programming) to find a shortest-path so- lution as a basic feasible solution. Based on this solution, we use the Genetic Al