2019 ICM Problem D: Time to leave the Louvre

2019 ICM
Problem D: Time to leave the Louvre
The increasing number of terror attacks in France[1]
requires a review of the emergency
evacuation plans at many popular destinations. Your ICM team is helping to design evacuation
plans at the Louvre in Paris, France. In general, the goal of evacuation is to have all occupants
leave the building as quickly and safely as possible. Upon notification of a required evacuation,
individuals egress to and through an optimal exit in order to empty the building as quickly as
possible.
The Louvre is one of the world’s largest and most visited art museum, receiving more than 8.1
million visitors in 2017[2]
. The number of guests in the museum varies throughout the day and
year, which provides challenges in planning for regular movement within the museum. The
diversity of visitors -- speaking a variety of languages, groups traveling together, and disabled
visitors -- makes evacuation in an emergency even more challenging.
The Louvre has five floors, two of which are underground.
Figure 1: Floor plan of Louvre[3]
The 380,000 exhibits located on these five floors cover approximately 72,735 square meters,
with building wings as long as 480 meters or 5 city blocks[3]
. The pyramid entrance is the main
and most used public entrance to the museum. However, there are also three other entrances
usually reserved for groups and individuals with museum memberships: the Passage Richelieu
entrance, the Carrousel du Louvre entrance, and the Portes Des Lions entrance. The Louvre has
an online application, “Affluences” (https://www.affluences.com/louvre.php), that provides realtime
updates on the estimated waiting time at each of these entrances to help facilitate entry to
the museum. Your team might consider how technology, to include apps such as Affluences, or
others could be used to facilitate your evacuation plan.
Only emergency personnel and museum officials know the actual number of total available exit
points (service doors, employee entrances, VIP entrances, emergency exits, and old secret
entrances built by the monarchy, etc.). While public awareness of these exit points could provide
additional strength to an evacuation plan, their use would simultaneously cause security concerns
due to the lower or limited security postures at these exits compared with level of security at the
four main entrances. Thus, when creating your model, your team should consider carefully when
and how any additional exits might be utilized.
Your supervisor wants your ICM team to develop an emergency evacuation model that allows
the museum leaders to explore a range of options to evacuate visitors from the museum, while
also allowing emergency personnel to enter the building as quickly as possible. It is important to
identify potential bottlenecks that may limit movement towards the exits. The museum
emergency planners are especially interested in an adaptable model that can be designed to
address a broad set of considerations and various types of potential threats. Each threat has the
potential to alter or remove segments of possible routes to safety that may be essential in a single
optimized route. Once developed, validate your model(s) and discuss how the Louvre would
implement it.
Based on the results of your work, propose policy and procedural recommendations for
emergency management of the Louvre. Include any applicable crowd management and control
procedures that your team believes are necessary for the safety of the visitors. Additionally,
discuss how you could adapt and implement your model(s) for other large, crowded structures.
Your submission should consist of:
One-page Summary Sheet,
Your solution of no more than 20 pages, for a maximum of 21 pages with your summary.
Judges expect a complete list of references with in-text citations, but may not consider
appendices in the judging process.
Note: Reference list and any appendices do not count toward the 21-page limit and
should appear after your completed solution.
References:
[1] Reporters, Telegraph. “Terror Attacks in France: From Toulouse to the Louvre.” The
Telegraph, Telegraph Media Group, 24 June 2018, www.telegraph.co.uk/news/0/terrorattacks-france-toulouse-louvre/.
[2] “8.1 Million Visitors to the Louvre in 2017.” Louvre Press Release, 25 Jan. 2018,
presse.louvre.fr/8-1-million-visitors-to-the-louvre-in-2017/.
[3] “Interactive Floor Plans.” Louvre - Interactive Floor Plans | Louvre Museum | Paris,
30 June 2016, www.louvre.fr/en/plan.
[4] “Pyramid” Project Launch – The Musée du Louvre is improving visitor reception
(2014-2016).” Louvre Press Kit, 18 Sept. 2014,
www.louvre.fr/sites/default/files/dp_pyramide%2028102014_en.pdf.
[5] “The ‘Pyramid’ Project - Improving Visitor Reception (2014-2016).” Louvre Press
Release, 6 July 2016, presse.louvre.fr/the-pyramid-project/.
Glossary:
Bottlenecks – places where movement is dramatically slowed or even stopped.
Emergency personnel – people who help in an emergency, such as guards, fire fighters,
medics, ambulance crews, doctors, and police.

因为专业,所以值得信赖。如有需要,请加QQ:99515681 或邮箱:[email protected]

微信:codinghelp

原文地址:https://www.cnblogs.com/cccccchelper/p/10335499.html

时间: 2024-08-30 16:09:34

2019 ICM Problem D: Time to leave the Louvre的相关文章

2019美赛D题 人员疏散模型Python编程

Louvre_Evacuation 题目来源:2019年 美赛 D题 完整代码请见:https://github.com/izcat/Louvre_Evacuation 2019 ICM Problem D: Time to leave the Louvre 问题背景 法国发生的恐怖袭击越来越多,在许多热门目的地,亟需一个应对紧急情况的疏散计划. 你们的ICM团队正在帮助设计在法国巴黎卢浮宫的疏散计划. 总的来说,疏散的目标是让所有的人都撤离,尽快安全离开大楼. 接到疏散通知后,为了尽快清空建筑

2018 数学建模美国赛思路

2018 数学建模 美国赛 D 建模思路 和文章大纲 题目 2018 ICM Problem D: Out of Gas and Driving on E (for electric, not empty) For both environmental and economic reasons, there is global interest in reducing the use of fossil fuels, including gasoline for cars. Whether mo

ARTS Week 7

Dec 9, 2019 ~ Dec 15, 2019 Algorithm Problem 38.Count And Say 外观数列 题目链接 题目描述: 外观数列 是一个整数序列,从数字 1 开始,序列中的每一项都是对前一项的描述.前六项及其说明如下: 1 // base 11 // 描述[1]:1个1 -> 11 21 // 描述[2]:2个1 -> 21 1211 // 描述[3]:1个2,1个1 -> 1211 111221 // 描述[4]:1个1,1个2,2个1 ->

Frets On Fire --- 2019 Codeforces Global Round 2 Problem D

原题:https://codeforces.com/contest/1119/problem/D 题意大概是一个n行1e18列的矩阵,其中每行第一个数为s[i],剩下的数每行依次以1的速度递增.就是说,矩阵元素 a[i][j] = s[i] + j .有q个询问,每个询问有两个参数l,r,求矩阵第l列到第r列(所有行)一共出现了几个不同的数. 这道题首先要先想到,两个参数 [l,r] 其实等价于一个参数 [0,r-l] ,也就是说矩阵第0~r-l行出现的数字的个数其实和第l-r行出现的个数是一样

hdu 2019多校 Just Skip The Problem

题目传送门:Just Skip The Problem 思路: n<=1e9. 最优方案,即对每位进行询问,一共n个二进制位.方案数->n! 由于题目中让你总方案数 % 1e6+3. 则可以想到, n>=1e6+3 的时候,全都是0.前面的则先打表预处理就好. 代码: #include<bits/stdc++.h> using namespace std; #define ll long long const int maxn=1e6+10; const int mod=1e

【2019.8.14】2019QB学堂DP图论班第一次考试 Problem C

Problem C Problem Description Tarzan 非常烦数轴因为数轴上的题总是难度非常大.不过他非常喜欢线段,因为有关线 段的题总是不难,讽刺的是在一个数轴上有 n 个线段,Tarzan 希望自己喜欢的东西和讨厌的 东西不在一起,所以他要把这些线段分多次带走,每一次带走一组,最多能带走 k 次.其实 就是要把这些线段分成至多 k 组,每次带走一组,问题远没有那么简单,tarzan 还希望每次 选择的线段组都很有相似性,我们定义一组线段的相似性是组内线段交集的长度,我们现在

Contest1692 - 2019寒假集训第三十一场 UPC 11075 Problem D 小P的国际象棋

非常简单的单点修改+区间加+区间查询.我用的是最近刚学的区间修改版本树状数组.  直接维护即可,注意修改后的单点值已经不是a[i],或者b[i],要通过区间查询求单点.不然是错的. 区间修改版本树状数组: #include<iostream> #include<string.h> #include<stdio.h> #include<algorithm> #define LL long long using namespace std; LL c_p[400

2019 GDUT Rating Contest III : Problem C. Team Tic Tac Toe

题面: C. Team Tic Tac Toe Input ?le: standard input Output ?le: standard output Time limit: 1 second Memory limit: 256 megabytes Farmer John owns 26 cows, which by happenstance all have names starting with different letters of the alphabet, so Farmer J

2019 GUDT WPTC 1 Div2 Problem E(题解) codeforces 115B

原题 题目大意 题目背景是割草,给一个图,然后给出图中草的坐标的,然后要把这些草全部割掉,工作员从图中的(1,1)坐标出发,刚开始面向右边,每次只能进行两个操作 (1)往面向的方向走一格(2)往下走一格并且转向.问工作员把草全部割掉至少走几步? 题目分析 有题可知工作员的行进方向,第一行朝右,第二行朝左,第三行又朝右.因此只要想明白题目还是很好解的,具体过程我会在代码里注释. 代码 1 #include <cstdio> 2 #include <cmath> 3 #include