美赛： 特等奖1902407---数学建模.pdfVIP

For office use only Team Control Number For office use only 1902407 T1 ________________ F1 ________________ T2 ________________ F2 ________________ T3 ________________ Problem Chosen F3 ________________ T4 ________________ D F4 ________________ 2019 MCM/ICM Summary Sheet. In case of the terrorist attacks in France, the Louvre needed emergency evacuation plans to avoid danger. This paper first establishes the goal programming model with the minimum total evacuation time to make sure that people in building can be evacuated safely and quickly. The model divides the evacuation time into the moving phase of the room channel, the up and down building phase, the entry and exit phase, and the accident occurrence phase. By optimizing each of these stages, the goal of minimum total time is achieved. In order to achieve optimal path, we improve the Dijkstra algorithm and find the most efficient route from each room to the exit. In addition, we propose a dynamic scheduling algorithm between the same floor and a dynamic scheduling algorithm between different floors to solve the congestion problem according to the goal planning. Furthermore, we have designed targeted response strategies for different characteristics of vulnera