2015美赛D题获一等奖论文
- 格式:pdf
- 大小:515.69 KB
- 文档页数:19
摘要“天然肠衣搭配问题”数学建模的目的是设计一种最优方案,使得给定一批原材按照一定的组装要求装出成品捆数最多。
本题中需要考虑到该如何降级使用每段剩余原材料,如何在给定的误差范围内将误差降至最低,以及如何把组装成品的时间限制在30分钟内,并且所用时间尽可能的越短越好,从而得出成品最多捆数。
问题一:把给定的表2原料描述表中的一批原材料,根据表1成品规格表中的规格要求进行分段组装,再结合搭配方案具体要求(3)、(4),考虑到将误差降至最低,将剩余材料降级使用,尽可能的减少原材料的浪费。
因此我们考虑从第三段即长度为14—25.5米的材料开始分段组装,按整数线性规划化得出模型,利用LINGO软件求出第三段中原材料最多能组装出的成品捆数。
然后将第三段中剩余的原材料降级为第二段即长度为7—13.5米的材料与原有的第二段原材料进行组装,按整数线性规划得出模型,利用LINGO软件求出第二段中原材料最多能组装的成品捆数。
接着将第二段中剩余的原材料降级为第一段即长度为3—6.5米的材料与原有的第一段原材料进行组装,按整数线性规划得出模型,利用LINGO软件求出第一段中原材料最多能组装的成品捆数。
最后将所有的剩余原材料在进行组装得出最多捆数。
将以上四个最优解相加,即得出本题中最优解,此方案即为最优方案。
问题二:在成品捆数相同的方案中,要选出最短长度最长的成品最多的方案即是本题中的最优方案。
将最短长度最长的成品作为目标函数,建立整数线性规划模型,利用C++编程软件求出最优解,最终得出最优方案。
关键字:捆数最多搭配方案整数线性规划模型LINGO软件C++编程软件一、问题的重述天然肠衣(以下简称肠衣)制作加工是我国的一个传统产业,出口量占世界首位。
肠衣经过清洗整理后被分割成长度不等的小段(原料),进入组装工序。
传统的生产方式依靠人工,边丈量原料长度边心算,将原材料按指定根数和总长度组装出成品(捆)。
原料按长度分档,通常以0.5米为一档,如:3-3.4米按3米计算,3.5米-3.9米按3.5米计算,其余的依此类推。
基于非线性曲线拟合的经纬度测量方法摘要本文首先基于天体物理学知识,构造出地球上某处直杆的影长与时间的函数关系式;然后运用非线性曲线拟合的方法,求解缺省参数,再根据直杆影长的变化规律,推算出测量点的地理位置及所处的日期。
在问题一中,本文以北京时间为参考时间,对地球上某一点处直杆影长的影响因素进行分析,发现其与直杆所处纬度、太阳直射点处纬度、所处时刻及经度等因素有关,结合地理知识构造出影长与影响因素的函数关系式。
在各项参数均已给定的情况下,即可作出题目所要求的影长-时间变化曲线。
对于问题二,本文由附件1给定的时刻及其影长,运用非线性曲线拟合的方法,利用问题一中建立的关系式,将时间与影长作为已知参数,利用lsqcurvefit函数拟合求解经纬度参数。
联系实际,筛选出可能的4个位置,并认为海南省白沙黎族自治县是最有可能的地点。
问题三与问题二基本相似,本文仍然在附件所得的数据基础上进行lsqcurvefit非线性曲线拟合,得到经度、纬度以及赤纬的可行解,根据所求赤纬,通过查表可以得到可能的日期。
由附件2得到3个可能的地点与6个可能的日期,并认为其中新疆维吾尔自治区喀什地区巴楚县是最有可能的地点,5月24日或7月20日是最有可能的日期;由附件3同样得到3个可能的地点与6个可能的日期,认为湖北省十堰市郧西县与陕西省商洛市山阳县均是可能的地点,可能的日期为2月6日或11月6日前后。
对于问题四,首先用MATLAB进行图像处理并得到等时间间隔的图片,然后经过筛选得到21张图片。
经滤镜处理后,由所得帧的图像得到影长与杆长的比例关系,进而得到不同时刻下的影长。
在日期已知的情况下,问题四应用非线性拟合函数fit得到可行解,筛选后得到最可能地点为内蒙古自治区乌兰察布市丰镇市;若未给日期条件,在本题上一问的基础上,将太阳赤纬设为未知,利用fit函数求出可行解,经筛选得到最可能的地点为内蒙古自治区乌兰察布市,日期为6月6日或7月8日,与准确日期相差无几。
参赛密码(由组委会填写)第十二届“中关村青联杯”全国研究生数学建模竞赛学校重庆邮电大学参赛队号10617004队员姓名1.汪雄2.余贝3.李无忧参赛密码(由组委会填写)第十二届“中关村青联杯”全国研究生数学建模竞赛题 目 面向节能的单/多列车优化决策问题 摘 要:本文针对轨道交通系统的能耗问题,研究了单列车到多列车的运行优化方案。
该问题是一个典型的非线性多约束条件的优化问题。
对于单列车,在满足约束条件的情况下,通过寻找最佳列车工况模式转化点求得最小能耗。
对于多列车的运行,不仅要考虑不同工况对能量消耗的影响,而且需要考虑制动再生能量的利用,从而使得综合能耗最小。
同时,针对列车晚点问题也进行了优化调整。
通过建模及仿真,得到了最优能耗运行方案。
针对问题一的第(1)问单列车的优化问题,建立了定时约束条件下的最小能量控制模型,利用遗传算法进行寻优。
通过引入罚函数,对约束条件添加“惩罚”因子,减少了模型中的约束条件。
最后求得当距离A6车站189.6m 处,列车由牵引转变为惰行状态,再当距离A6车站1289.6m 处,列车由惰行转变为制动状态时,存在最低能耗为()10.6939E kw h =⋅。
针对问题一的第(2)问,主要是在问题一第(1)问的基础上将列车的运行区间扩展为两个车站。
需要综合考虑每站运行时间不同对能量的影响。
建立变时长约束条件下的最小能量控制模型,同样运用遗传算法来对模型进行求解,求得当6A 车站到8A 车站之间四个工况(惰行,制动,惰行,制动)模式转换点的位置与6A 的距离分别为276m ,1263.1m ,1468.1m ,2575.3m 时,系统总体能耗最低为()20.5745E kw h =⋅。
针对问题二的第(1)问,由单列车转化为多列车的节能优化问题,主要分两步进行,首先建立单列车在全程线路上运行时的最优速度距离曲线关系,再在此基础上建立节能能量与列车发车间隔的关系,得到综合节能方案,从而得到目标函数,建立非线性约束模型。
PROBLEM A:Eradicating Ebola问题一:根除埃博拉The world medical association has announced that their new medication could stop Ebola and cure patients whose disease is not advanced. Build a realistic, sensible, and useful model that considers not only the spread of the disease, the quantity of the medicine needed, possible feasible delivery systems, locations of delivery, speed of manufacturing of the vaccine or drug, but also any other critical factors your team considers necessary as part of the model to optimize the eradication of Ebola, or at least its current strain. In addition to your modeling approach for the contest, prepare a 1-2 page non-technical letter for the world medical association to use in their announcement.世界医学学会已经宣布他们发现了新的药物可以阻止埃博拉病毒并能治愈病情不再恶化的病人。
创建建立一个现实的、明智的和有用的模型,该模型不仅考虑了疾病的蔓延、需药物的量、可能可行的输送系统、交货地点、疫苗或药物的生产速度,也要包括你的团队认为必要的其他关键因素,该因素应作为优化根除埃博拉病毒模型的一部分,或者至少作为目前的应变的手段。
会议筹备优化模型摘要能否成功举办一届全国性的大型会议,取决于会前的筹备工作是否到位。
本文为某会议筹备组,从经济、方便、满意度等方面,通过数学建模的方法制定了一个预订宾馆客房、租借会议室和租用客车的合理方案。
首先,通过对往届与会情况和本届住房信息有关数据的定量分析,预测到本届与会人数的均值是662人,波动范围在640至679之间。
拟预订各类客房475间。
其次,为便于管理、节省费用,所选宾馆应兼顾客房价位合适,宾馆数量少,距离近,租借的会议室集中等要素。
为此,依据附件4,借助EXCEL计算,得出7号宾馆为10个宾馆的中心。
然后,运用LINGO软件对选择宾馆和分配客房的0-1规划模型求解,得出分别在1、2、6、7、8号宾馆所预订的各类客房。
最后,建立租借会议室和客车的整数规划模型,求解结果为:某天上下午的会议,均在7、8号宾馆预订容纳人数分别为200、140、140、160、130、130人的6个会议室;租用45座客车2辆、33座客车2辆,客车在半天内须分别接送各两趟,行车路线见正文。
注:表中有下画线的数字,表示独住该类双人房间的个数。
关键词:均值综合满意度EXCEL 0-1规划LINGO软件1.问题的提出1.1基本情况某一会议服务公司负责承办某专业领域的一届全国性会议。
本着经济、方便和代表满意的原则,从备选10家宾馆中的地理位置、客房结构、会议室的规模(费用)等因素出发,同时,依据会议代表回执中的相关信息,初步确定代表总人数并预定宾馆和客房;会议期间在某一天上下午各安排6个分组会议,需合理分配和租借会议室;为保证代表按时参会,租用客车接送代表是必需的(现有45座、36座、33座三种类型的客车,租金分别是半天800元、700元和600元)。
1.2相关信息(见附录)附件1 10家备选宾馆的有关数据。
附件2 本届会议的代表回执中有关住房要求的信息(单位:人)。
附件3 以往几届会议代表回执和与会情况。
附件4 宾馆平面分布图。
2020小美赛d题优秀论文Recently, the US presidential election is in progress. Biden and trump are com-peting fiercely in economic governance, epidemic prevention and control, infrastructure construction and foreign policy. In order to evaluate the possible impact of the two candidates on the U.S. and China's economy, and to discuss China's economic coun-termeasures in related fields, we established an evaluation model based on AHP. We divide the model into two parts. One is the quantitative method of the two candidates' campaign speeches, papers and related reports. The second is to use indicators to build an economic impact assessment model.In order to determine the indicators of economic impact, we have made statistics on the most significant factors through questionnaire survey. Based on the results of thequestionnaire survey and related literature reading, we establish the pairwise comparison matrix of related factors and calculate the weight vector of related factors. On the basis of the above results, we use the LDA Algorithm of natural language processing to evaluate the importance of the two candidates in various aspects according to the word frequency of the Related words of each index, and finally obtain the comprehensive evaluation of the economic impact of the two candidates on the United States and China.Finally, based on a comprehensive assessment of the impact of thetwo candidates on China's economy, as well as their attention and literature on different fields, we put forward our suggest on China's economic policies in relevant fields. It is hoped that China can gain better advantages in the cooperation and competition between China and the United States。
分析溃坝:针对南卡罗来纳州大坝坍塌建立模型 摘要萨鲁达大坝建立在卡罗莱纳州的墨累湖与萨鲁达河之间,如果发生地震大坝就会坍塌。
本文通过建立模型来分析以下四种大坝决口时水的流量以及洪水泛滥时水的流量:● 大坝的绝大部分被瞬间侵蚀看成是大坝瞬间彻底坍塌;● 大坝的绝大部分被缓慢侵蚀看成是大坝延期彻底坍塌;● 管涌就是先形成一个小孔,最终形成一个裂口;● 溢出就是大坝被侵蚀后,形成一个梯形的裂口。
本文建立了两个模型来描述下游洪水的泛滥情况。
两个模型都采用离散网格的方法,将一个地区看成是一个网格,每个网格都包含洪水的深度和体积。
复力模型运用了网格的速度、重力以及邻近网格的压力来模拟水流。
下坡模型假定水流速度与邻近网格间水位高度的成正比例。
下坡模型是高效率的、直观的、灵活的,可以适用于已知海拔的任何地区。
它的两个参数稳定并限制了水流,但该模型的预测很少依赖于它们的静态值。
对于萨鲁达溃坝,洪水总面积为25.106km ;它还没有到达国会大厦。
罗威克里克的洪水向上游延伸了km 4.4,覆盖面积达24.26.1km -变量及假设表1说明了用来描述和模拟模型的变量,表2列出了模拟程序中的参数。
表 1模型中的变量.变量 定义溃坝时的水流量速率1TF Q 瞬间彻底坍塌2TF Q 延期彻底坍塌PIPE Q 管涌OT Q 溢出peak Q 最大流速溃坝时水流出到停止所用时间1TF t 瞬间彻底坍塌2TF t 延期彻底坍塌PIPE t 管涌OT t 溢出V ∆ 溃坝后从墨累湖里流出的水的总体积Lm Vol 墨累湖的原来体积LM Area 墨累湖的原来面积breach d 从裂口到坝顶距离breach t 从裂口开始到溃坝形成的时间 近似圆锥的墨累湖的侧面一般假设● 正常水位是在溃坝前的湖水位置。
● 河道中的水流不随季节变化而变动。
● 墨累湖里的水的容积可以看作为一个正圆锥(图1 )。
表2 模拟程序中的参数 参数 所取值 意义BREACH_TYPE 变量 瞬间彻底坍塌,延期彻底坍,管涌,溢出模型中的一种 T ∆ 0.10 时间不长的长度(s)MIN_DEPTH 0001.0 网格空时的水的深度(m) FINAT T 100000 大坝彻底决口所用时间 b T 3600 溃坝达最大值的时间(s) peak Q 25000 溃坝的最大流速(m 3/s) breach d 30 蓄水池的最初深度(m) LM Volume 910714.2⨯ 墨累湖的总体积(m 3) LM Area 610202⨯ 墨累湖的总面积(m 2)k 504.0 扩散因素 (控制两网格间交换的水的数量) MAX_LOSS_FRAC 25.0 单位网格中水的最大流失量图 1. 水库近似一个正圆锥.大坝假设● 萨鲁达大坝在以下四种方式之一坍塌:-瞬间彻底坍塌,-延期彻底坍塌,-管涌,-溢出。
The Keep-Right-Except-To-Pass RuleSUMMARYDriving automobiles on the right is the rule in some countries, the purpose of this paper is to analyze different traffic rules through establishing models.Firstly, we established five models: car-following model, cellular automata model, fluid-dynamics model, speed-safety model and two-lane cellular automata model. We analyzed the models and processed the data by using SPSS and MATLAB, and then we simulated the data by utilizing VISSIM.For question one, we got the indicators of high load degree (6.1≥) and low load degree (7.0≤) by the definition. By comparison, we chose the car-following model and cellular automata model to analyze its impact on traffic flow. Utilizing speed-safety model, we discussed the road safety. We examined the tradeoffs between traffic flow and safety intuitively through diagrams. To a certain degree, the rule is effective in promoting traffic flow.For question two,the original rule is not the most effective one, based on the two-lane cellular automata model, we put forward the more effective rules: the lane-changing rule and the merging rule. It turned out that the rules can promote 8.5% traffic flow and prevent blocking.For question three, according to the data by simulating and the ITS cellular automata model, we received a figure which is the comparison of ITS cellular automaton model and the original model. Then we drew a conclusion that the traffic condition improved a lot under the ITS (Intelligent Transportation System). In this case, the traffic flow promoted 27.3% and the road safety improved significantly.Key words:Traffic flow Cellular automata model ITS VISSIM Car-following modelContents1. Introduction (4)2. The Description of the Problem (4)2.1Build a mathematical model to analyze this rule (4)2.2 Put forward more effective rules (4)2.3 Intelligent Traffic System (4)3. Problem Analysis (5)3.1 Problem One (5)3.2 Problem two....... (5)3.3 Problem three (5)4.Symbols and assumptions (5)4.1Symbols (5)4.2 Assumptions (6)5.Models (7)5.1 Model A: The car-following model (7)5.2 Model B: Microscopic – cellular automata Model (8)5.3 Model C: The Macroscopic – fluid-dynamics Model (10)5.4 Model D: The Speed-safety Model (11)5.5 Model E: The Two-lane cellular automata Model (12)6.Solution and Conclusions of the problem (13)6.1 Problem One (13)6.1.1 The Road load (13)6.1.2 The relationship between vehicle flux and load degree (15)6.1.3 The relationship of traffic safety and load degree (16)6.1.4 Different maximum-speed-limit influence on traffic (17)6.2 Problem Two (18)6.2.1The Lane-Changing rule of different speed (18)6.2.2 Merging Rule (20)6.2.3 The Keep-Left Rule (21)6.3 Problem Three (21)6.3.1 Freeway Tele-Traffic Speed Intelligent Control System (21)6.3.2 The cellular automata model of ITS (23)6.3.3 The cellular automata model of ITS (23)6.3.4 The security system based on ITS (25)7. Strengths and Weaknesses (25)7.1 Strengths (25)7.2 Weaknesses (25)8. References (26)I. IntroductionWith increasing number of vehicles, it is well known that the traffic problem becomes an important topic in nowadays. It is common that driving automobiles on the right is the rule and overtaking is allowed in the vehicular motion process on the multi-lane freeways. In this case, safety and the rate of the vehicles have a relationship with the traffic flux.Whether driving automobiles on the right or on the left do not have a strict boundaries, it is only a custom. We established the Lane-Changing rule of different speed respective and the Merging Rule. In countries where driving automobiles on the left is the norm, the rules can also be used in the keep-left rule.Intelligent Transportation Systems (ITS) are effective ways to solve or alleviate various traffic problems. The main functions of expressway traffic safety early-warning system are to provide corresponding control strategy and prevent the happening of accidents, by the traffic conditions and meteorological conditions, traffic flow characteristics, and so on.II. The Description of the Problem2.1 Build a mathematical model to analyze this rule.Build and analyze a mathematical model to analyze the performance of this rule in light and heavy traffic. You may wish to examine tradeoffs between traffic Flux and safety, the role of under- or over-posted speed limits (that is, speed limits that are too low or too high), and/or other factors that may not be explicitly called out in this problem statement.2.2Put forward more effective rulesIs this rule effective in promoting better traffic flux? If not, suggest and analyze alternatives (to include possibly no rule of this kind at all) that might promote greater traffic flux, safety, and/or other factors that you deem important. In countries where driving automobiles on the left is the norm, argue whether or not your solution can be carried over with a simple change of orientation, or would additional requirements be needed.2.3 Intelligent Traffic SystemLastly, the rule as stated above relies upon human judgment for compliance. If vehicle transportation on the same roadway was fully under the control of an intelligent system –either part of the road network or imbedded in the design of all vehicles using the roadway – to what extent would this change the results of your earlier analysis?III. Problem Analysis3.1 Problem OneIn order to verify whether the rules are effective, we established mathematical models to explain the relationship among the safety, traffic flow, density and speed. Then, it needs to consider how to adopt our models in the analysis of the performance of this rule in light and heavy traffic. At last, we give a relationship of traffic flux and load degree under the rules.3.2 Problem twoThrough the above analysis and access to a large number of data, we can see that the above rule is effective to some extent. But the traffic flux and safety easily affected by road load degree under the rule, therefore, we put forward a more effective rule. We established the Lane-Changing rule of different speed respective and the Merging Rule. The rules can also be used in the keep-left rule.3.3 Problem threeThe increasing demand for transport creates a huge challenge to local and central governments. ITS technologies and concepts have begun to be embedded within the transportation system. We established the ITS cellular automata model and it played an important role in improving the traffic flow, ITS can increase the road safety too.IV. Symbols and assumptions4.1 Symbols Table 1 Symbols and instructionsSymbolsInstructions AR accident rate km veh time ⋅810/σ the speed standard deviation h km /Death traffic accident death rate %V ∆ vehicle operating speed difference h km /Nthe annual average accident frequency times/yearVaverage Speed h km / CR millions of vehicle kilometers casualty rate, time/million vehiclekilometerst i g ,the load degree of section i at time t t i d ,the actual density of section i at time t cri dthe critical density of section i Llength of vehicle dv density of vehicles t i g , the load degree of section i at time tt i occ , the time occupancy ratio of section i at time tcri occ the time occupancy ratio of section i at the maximum capacitythe traffic fluxL the total lengtha the vehicle rate of decelerationmax v the maximum speed limitl Nthe total number of vehicles 4.2 Assumptions●Assume that the vehicles on the freeway are same type ●Assumptions used in modeling examples demonstrate true and reliable data ●Assuming the vehicles are all Normal driving ● Assume that the freeway without forkV. Models5.1 Model A: The car-following modelAs shown in the Fig.1, taking a special case of the car-following model in which vehicle are evenly spaced long the road and move with uniform velocity. With 0d , equal to the car length plus a minimum gap between vehicle, and the distance headway d between vehicles.]1[ Thus)(0d d N L l += With a densitydd L N dv l +==01Fig.1 simple graphThe flux φ is a function of density vdv dv =)(φA choice has to be made to decide the safe velocity for a given distance. One approach could be that a car must be able to come to a complete stop within that distance.ad v 2-=,0<aHowever this approach is inappropriate because driver reaction time isn’t taken into account and drivers generally don’t drive in this manner. A more appropriate approach is to use the road safety “Two -second rule”, 0t d v = Speed limit now needs to be taken into account, otherwise, as the density goes to zero, velocities would go to infinity,⎪⎪⎭⎫ ⎝⎛=0max ,min t d v v This naturally gives rise to the two phases in the fundamental diagram, the free flowphase max 0v t d >and the jammed phase max 0v t d < The resulting flux is then given bydd v d +=0max )(φ , free-flow )()(00d d t dd +=φ, jammed Or ⎪⎩⎪⎨⎧-+≤=-otherwise t dv d d t v dv for dv v dv 00100max max 1)()(φ5.2 Model B: Microscopic – cellular automata ModelCellular automata (CA) models are an idealization of physical systems by using discrete time and space and each unit can only have a finite number of discrete states. CA models are popular because in general they are highly computationally efficient due to their use of integer values for time, space and state. This is the model I have chosen to base my numerical simulation on and it is discussed in more detail as below.In the Nagel-Schreckenberg model (NaSch), the road is divided into discrete cells or lattice sites; each cell is either empty or occupied by exactly one car at each time step. Position, velocity, acceleration and time are treated as discrete integer variables making this a computationally efficient model. The n’t h vehicle can have a velocity max ,,2,1,0v v n =. As a first step n v the road is initialized randomly as being occupied 1 or unoccupied 0. At each occupied site, a car is assigned an integer velocity max v v ≤. Car positions are updated in parallel. Their velocities are set according to the following rules. i. Accelerate: All vehicles are accelerated by one until a maximum of max v .This represents how drivers like to drive at the speed limit where possible.),min(max 1v v v n n +→ii. Decelerate: If there is a car closer than n v , decelerate so as not to crash.),min(1-→n n n d v viii. Randomization: With a given probability p , randomly decrease the velocity by one. This represents imperfect driving and over-braking.)0,1max(-→n n v v With probability piv. Move: With all the velocities set, the position of each car is updated.n n n v x x +→These steps can be best understood with a visual example in Fig.2. To avoid creating and destroying vehicle at either end of the road periodic boundary conditions can be used. For L v x n n >+, where L is the length of the road:L v x x n n n -+→Fig.2 Example for the application of the update rules.We have assumed max v =2 and p =1/3.Therefore, on average one-third of the vehicle qualifying will slow down in the randomization step.An addition to the NaSch model is t he “slow to start” probability p . When vehicle come to a complete stop, there is a probability p that they do not move accelerate at all,in that time step. This reproduces the phenomenon of how drivers are slow to move off from a standing start. In real situations this further add to the problem of phantom traffic jams and the size of the tail back associated with them.]2[5.3 Model C: The Macroscopic – fluid-dynamics ModelAt a macroscopic scale traffic on a road appears to Flux like a fluid in a stream. A macroscopic theory can be developed by adapting the hydrodynamic theory of fluids. Traffic can be thought of as essentially a one-dimensional comprisable fluid. Away from junctions no vehicles enter or leave the system so there is a conservation of vehicles.]3[ Speed v ,density dv and flux φare called three elements of traffic flux ,flux is defined as the product of density and speed :vdv =φWhen there is a few vehicle, vehicles run with free-flux speed f v ,We defined this state of traffic flux as sparse flux; With the increase of vehicle ,the running speed will decrease, When the vehicle density reaches a critical value(Blocking density j k ),there will be a traffic jam.According to the differential equation of motion ,we established a multiple lanes suitable for overtaking.Suppose flux of in and out of the lane line is r ,we can derive the equation belowdxdr x t dv =∂∂+∂∂φ Overtaking rate n defined as the ratio of overtaking flux and driveway flux.φ/r n =,)1,1(-∈n We can get the speed-density model as below⎪⎪⎪⎩⎪⎪⎪⎨⎧<<-≤≤----≤≤-+=nj n j r j f n j f n j r j f n f n j f r f f e k dv e k e k dv m v e k dv k m m e k e dv k m v e k m m e k dv k e dv k m m v v 21)1(2114141141])1([φφφ Speed is a function of time and distance, thus speed can be described by),(t x v v =Acceleration is the derivative of velocity versus timexv v t v dt dx x v t v dt t x dv dt dv ∂∂+∂∂=∙∂∂+∂∂===),(αWe transformed the influence of overtaking into viscous resistance w τ and we used macro-variable instead of micro-variable, therefore we can getw e t t x v dv v Td dv τ+-=)],()([1Viscous resistance xdvn v v v f w ∂∂+-=])([τ We can derive the equations belowxdv n v v v v dv v T x v v t v f e ∂∂+-+-=∂∂+∂∂])([])([1 We can derive the equations belowt r u k u k xt k k n i n i n i ni n i n i n i ∆+-∆∆+=--+)(111 )}]()([)(1)(){(1111n i n i n i f n i n i e n i n i e n i n i n i n i k k v v v v v v Tv v v v v x t v v -+-+-+-⋅-+∆∆+=---+T he above formula satisfy the condition mvv k dv x t f j∆∆≤∆5.4 Model D: The Speed-safety ModelThe frequency of accidents, mainly related to the speed discreteness, rather than magnitude of the speed. We made regression analysis to accident rate, the speed standard deviation and average velocity.The relational model []4are shown as fluxing:Speed change is directly related with several of the accident rate, average speed andthe calculation of driving speed discreteness, the greater the chance of traffic accidents. Form the model, we can see that the rate of speed change is directly related to the probability of accidents, average speed and the calculation of driving speed discreteness is higher, the likelihood of accidents are greater.σ0553.05839.9e AR =Car in the traffic accident ability may cause transformation happen, the kinetic energy will turn into energy and thermal energy to make the vehicle deformation, and the kinetic energy depends on the quality and speed. Vehicle energy changes resulting from accident square of the quality and speed. Obviously, the greater physical energy is, the more is the energy conversion , the more serious is the consequences of the accident , all above are causing greater casualties .The approximate function is shown in following []5:4)24.114(V Death ∆=The Burg formula:V VN ∆=536.1ln By accessing to information , we drawn a conclusion that when the average running speed decreases 1h km /, traffic accident casualty rate will decrease by 7%.The formula is:366.30405.000268.0-+-=Diff V CR5.5 Model E: The Two-lane cellular automata Model),1min(max v v d i i +<i other i d d >, safe back i d d >,other i d ,: the cell number of vehicle i and the former vehicle on the adjacent lane at time t, back i d ,: the cell number of vehicle i and the latter vehicle on the adjacent lane at time t, safe d :the safety distance.),min(max 1v v d i i +< refers to the lane changing motivation which show that vehicle i can not run as the expected speed on thelane .The vehicle i in the adjacent lane have better driving conditions than the original lane.i other i d d >, refers to the condition of the adjacent lane, safe back i d d >,refers to safety conditions which show that lane-changing will not cause congestion of the latter vehicles.VI. Solution and Conclusions of the problem6.1 Problem One6.1.1 The Road load1) Road load analysis is an important research direction of the road capacity analysis and management, commonly used in road or intersection level of service evaluation. It is calculated based on the ratio of road traffic to their capacity, i.e. C V /. Traffic density is an important indicator of the theory , which is the number of the existence of vehicle at some point and it reflects the road space utilization. When road traffic Flux satisfies its traffic capacity, road has the highest utilization rate, traffic running well, density value at this time is called the critical density. We define roadways actual density and the ratio of the critical density as a new calculation method, and as the important indexes for evaluation of road traffic running state.]6[ 2) The definition of road loadThe road load degree refers to at one point, the ratio of the actual density and the density of largest capacity in this section. Road load degree describes the levels of usage use of the road overall capacity, and reflects the utilization of road resources in space. calculation method :crit i t i d d g ,,=Obviously,0,≥s t i g .The load degree of the section closer to 0 , indicating that the lower extent of road traffic load , the better traffic running state; the load degree of the section closer to 1 , indicates that traffic load is close to saturation, the traffic Flux is close to the traffic capacity; the greater the load degree of the section, indicating that the heavier extent of road traffic load , the worse traffic running state.The relationship between road density and time occupancy ratio: time occupancy ratio refers to the ratio of the vehicle occupancy time accumulative total value and the determination of the time on the observation section of the road. Time occupancy ratio is not only related to traffic volume, but also related to the length and density of the vehicle. Assume the type and length of vehicle are the same of the observation section of the road, we can get the formula:dv L occ ⨯=In the case of vehicles with a certain length, the density has a linear relation with time occupancy ratio. Therefore, we can use the ratio of the actual time occupancy ratio and the time occupancy ratio at the maximum capacity to calculate the load degree of the section under specified conditions.]7[crit i crit i crit i s ti occ occ d L d L d d g ,,,,=⨯⨯==The relationship of load degree and vehicle speed is shown in Table 2 , we got the Fig.3by software Excel.Table 2 The standard of road evaluationFig.3 The relation ship of load degree and speedThe level o f trafficstateSpeed (km) The loaddegreeClassify the degree very smooth105~110 ≤0.2low loadcondition100~1050.2~0.4 basically smooth 95~100 0.4~0.6 90~950.6~0.7 travel steadily 85~90 0.7~0.9 normal loadcondition80~850.9~1 travel slowly 75~80 1~1.2 70~751.2~1.4 general congestion65~70 1.4~1.6 high loadcondition60~65 1.6~1.8 severe congestion55~60 1.8~250~55≥2Based on the level of traffic state, we defined high load condition when load degree is higher than 1.6 and low load condition when load degree is less than 0.76.1.2 The relationship between vehicle flux and load degreeThe relationship between vehicle flux and load degree gives a good understanding of what is happening to traffic. By comparing Model B and Model C, we found that the latter is more effective. According to the Model B, We get a combination of statistics as shown in Table 3,by analyze the statistics by software MATLAB, we got a diagram which is a plot of traffic flux and density as shown in Fig.4. At low densities when the traffic is in a free Fluxing phase, flux increases linearly with density. At high densities the traffic is in a congested state and flux decreases with density to a limit of no vehicles moving on a full road. Near the point of maximum flux there is a phase transition from free traffic to congested traffic.]8[Table 3The relationship of flux and densityFig.4 The relationship of flux and density6.1.3 The relationship of traffic safety and load degreeDensity /(vehicle per meter)57.915.622.128.339.751.762.998.6182.3Flux/(ve hicle per second)0 360.5 940.531594.322287.372973.362610.82336.841631.221087.37561.06What is known to all is that running speed and the speed directly affects the probability of highway accidents. If running speed is too high, the driver awareness of road conditions, the judgment on the driving environment will reduce, resulting in increasing braking distance[]9. On the contrary,speed is too slow can make overtaking frequency increased so that the probability of an increase in traffic accidents.Through access to information we knew that when the speed is greater than 60 km/h, every 5 km/h, the accident rate is twice higher than the original, at the same time, the severity of the accident will show exponential growth]10[as shown in Table 4.[]11.According to the Model D, we got the intuitive graphical as shown in Fig.5by SPSS.Table 4 The relationship between speed and accident riskThe speed of the vehicle (km) The relative value of accident50~60 1.0060-70 2.0070~80 4.1680~90 10.6090~100 31.81100~110 56.55Fig.5 The relationship of traffic safety and load degreeIn summary, the severity of the accident and the speed is not a linear relationship , the accident severity will produce more important along with the change of velocity change,the higher operating speed value , the greater the amount of change in the speed when the accident occurred. At last, the accident seriously degree is higher.6.1.4 Different maximum-speed-limit influence on trafficWe got a combination of statistics from document literature, by the statistics, we made the Table 5.]12[We got the intuitive graphical as shown in Fig.6 by MATLAB.Table 5 The relationship of flux and max vFig.6 The relationship of flux and max vIn summary, at low load degree when the traffic is in a free fluxing phase, flux increases linearly with density; at high load degree the traffic is in a congested state and flux decreases with density to a limit of no vehicles moving on a full road; near the point of maximum flux there is a phase transition from free traffic to congested traffic. The severity of the accident and the speed is not a linear relationship , the accident severity will produce more important along with the change of velocity change, the higher operating speed value , the greater the amount of change in the speed when the accident occurred.max v /(h km /)10 20 30 40 50 60 70 80 90 100 110 120Flux/(v ehicle/s) 0.081 0.154 0.229 0.286 0.36 0.356 0.362 0.36 0.359 0.367 0.369 0.3626.2 Problem TwoThrough the above analysis, we can see that the above rule is effective to some extent. But the traffic flux and safety easily affected by road load degree under the rule, therefore, we put forward a more effective rule.6.2.1 The Lane-Changing rule of different speedAccording to the Model B (the Na model), the road is divided into discrete cells or lattice sites; each cell is either empty or occupied by exactly one car at each time step. We established the Lane-Changing rule of different speed respectively. The NaSch model as follows:The acceleration process )1,min(max +→i i v v v The moderating process ),min(i i i d v v →Delay position stochastic as probability p )0,1max(-→i i v v Update position i i i v x x +=Based on the Model E (The STCA model), we put forward the lane-changing rule according to the real characteristics of changing lane.]13[ The rule is as follow:1=i T01=+i T),1min(max 1v v d i i +<-2,≥back i d i other i d d >, other back i v v ,≥change f P rand ,()<0=i T 11=-i T),1min(max 11v v d i i +<--safe back i d d >, ),1min(max ,v v d i other i +≥change s P rand ,()<Each lane can be seen as a one-dimensional cellular chain composed of cellular automata, the traffic is the mixed traffic flow, and the vehicle is divided into two types: fast type vehicle and slow type vehicle. Each vehicle takes up a cellular automata, we simulate by using periodic boundary conditions. So we can derive the equations belowL N l l 2/=ρ∑==lN i lilvN vl 01i l l v ρφ=Utilizing the statistics from literature ]14[, we got Fig.7 by the software MATLAB. Fig.7 shows that the average traffic flow under the new rule is higher the original rule, and it can still maintain traffic flow under the high density. From a certain extent, the newrule is more efficient than the original rule.Fig.7 The relationship of flux and densityAnother advantage of this new rule is to avoid congestion, as shown in the Fig.8, (a) is the jam of the slow vehicle, and F is the fast vehicle, S is the slow vehicle, C is the random vehicle. (b) shows that the slow vehicle ’s active lane changing make jam disappear at the next time step, (c) shows that the slow vehicle ’s active lane changing make jam disappear at the next time step.C cF S(a)C SF(b)C FS(c)Fig.8 The method of preventing the formation of block6.2.2 Merging RuleAs a first step to developing the model to reproduce a real road network we chose to have two roads merge into one. This is analogous to an on-ramp merging onto a single lane motorway. As shown in Fig.9 the two roads exist in parallel, independent of each other. Then there is a merging zone in which cars on road B must try and merge onto road A before road B comes to an end. Each road is updated independently, alternating between each, for every time step.The system is very dependent on the rules chosen for merging traffic. Priority should be given to those already on the main road A and cars on road B should filter in when there is space for them to do so. Our initial set of Merging Rule allowed B cars to move over whenever there was space. This led to virtually no flow on A while B cars were free flowing. This was because a car from B might slot in directly in front of an A car causing it to come to a complete stop in the next time step and thus create a traffic jam on road A and thereby making it even easier for even more B cars to move in. We imposed the rule that a car on road B can only move over if there are two empty spaces free, i.e. the empty space that the car is moving into and an empty space behind the one that it is moving into.Fig.9 The schematic diagram of Merging RuleMerging Rule, for a car on road B in the “merging zone”:i. The car’s velocity is still set by the road that it is on.ii. The car will try and move over at the earliest possible time when there are at least two spaces available on road A.iii. If the car succeeds in moving over it will move up on that new road as much as it can, until it catches up with another car or to the limit that its velocity allows.iv. If it cannot move over, its velocity is reduced by one and it moves forward on its own road to the limit where it reaches the end of the road, at which point it must stop. It should be noted that the length of the merging zone can be set to one if it is required to model a T junction with a yield sign.6.2.3The Keep-Left RuleBy looking up a large number of date, we draw a conclusion that driving automobiles on the left is the same as driving automobiles on the right, so the rule can be used in the country where driving automobiles on the left.6.3Problem ThreeThe increasing demand for transport creates a huge challenge to local and central governments. As it is clear that simply building new roads will not be the answer, optimal transport strategies will be needed.]15[6.3.1 Freeway Tele-Traffic Speed Intelligent Control SystemFig.10 The function diagram of FTSICS systemAs Fig.10 shows, freeway Tele-Traffic Speed Intelligent Control System (FTSICS) should gather the information of each road and manage it. According to the state of road traffic information, weather information and road network structure, FTSICS can calculate the limit speed of each road according to the traffic state information, weather information, and road network structure information and send the message to motorist, thus making the overall coordination of network traffic state.]15[。
Where is the MH 370?AbstractWhere is the crashed MH 370?This is an issue of global concern. In this article, the search work for the crashed aircraft is divided into three stages:determining the fall area, select the search location, arrange rescue equipment.To solve problems, we have set up three mathematical models.According to physics equations,we have established a differential equations model that can describe the crashed procedure of the aircraft.By combined maritime related cases,we have calculated the theoretical appeared area of the aircraft.Because of the large area of theory, it will be split into many small regions of equal area. With the limited search capability,we need to find a small piece where the aircraft is most likely to exist in.Then we use the conditional probability to establish a maritime search model and have got the actual search area and search paths. Each time a search is completed.We use a Bayesian probability formula to update the appearing probability of the aircraft in each small area if the crashed aircraft is not found.Besides,we resolve the model to acquire the actual search area and search paths.From an economic point of view, we have created a scheduling model of the search appliances with the existed search equipment. Then we made reasonable arrangements for personnel and equipment based on the results of the model.Keywords:Differential Equations Conditional ProbabilityBayesian Methods Nonlinear ProgrammingCONTENTS1. Introduction (2)2. Assumptions (2)3. Explanation of notations (3)4. Model One:the Aircraft Crashed Model4.1 Analysis of Model (4)4.2 Model Building (4)4.3 Solutions to the Model (5)4.3 Testing the Model (6)5. Model Two:the Maritime Search Model5.1 Analysis of Model (6)5.2 Bayesian Methods (7)5.3 Model Building (8)6. Model Three:the Search DevicesScheduling Model6.1 Analysis of Model (8)6.2 Building the Model………………………………………………………….. .86.3 Model Solving........................................................................ (9)7. Conclusions………………………………………………………….………. ..98. Strength and Weakness8.1 Model One (10)8.1 Model Two (10)8.1 Model Three (11)9. References (11)10.Paper Concerning Future Search Plans (12)11. Appendix............................................................................. (14)1.IntroductionAlthough science and technology are advanced rapidly in recent years,the crash incidents still occur now and then .Take Malaysia Airlines MH370 forexample, its crash have already attracted hundreds of millions of people's attention.In the case that it cannot send out any signal, the rescuers have to determine the best search strategy as soon as possible. In addition, due to the diversification of the search appliance, we have given the best scheduling schemes of the search appliance.The problems we have settled are listed as follow:●How to determine fall point of the aircraft in the open sea?●If we can search onlyparticulararea of seaevery time, how to determine thepossible search region?●When some important parameters of search equipment are known,how toget the best scheduling solution of the search devices?In order to deal with those problems above,we found some practical andefficient methods.●At the beginning,we established a physical model to describe theprocedureof the aircraft falling from the sky to the sea and gotthe possible crashedregion of theplane.●Moreover,we built a search model of Bayesian probability updating andobtained more realistic search strategies.●Last but not least,we found optimal scheduling scheme by establishingscheduling model of search equipment based on minimal costs.2. Assumptions●There is no land in the search sea.●The ocean currents in the search sea are very complex.●When the aircraft falls down, the airplane did not explode.●When the aircraft falls down, the plane fuselage remains level.●When the aircraft falls down, its acceleration of gravity remainsunchanged.●There are only two search devices:planes and ships.They can be scheduledtogether.3. Explanation of notationsTable 1 NotationSymbol MeaningG the gravity of the aircraftF rising force of the aircraft from the airf resistanceof the aircraft from the airM quality of the aircrafta horizontal acceleration of the aircraft when falling downxa vertical acceleration of the aircraft when falling downythe density of atmosphereC coefficient of resistancewC coefficient of rising forceuS extension area of aircraftwing1S bottom surface areaof aircraft2v speedin the horizontal directionxv speedin the vertical directionyv advancing speed of searching equipmentT maximum stay time in task searching areaw the width of sweeping the seaS the area of maritime searchregiona the number of the aircraftb the number of the shipv the speed of the aircraft1v the speed of the ship2c the cost of an aircraft per hour1c the cost of a ship per hour2w the scanning width of an aircraft1w the scanning width of a ship2T the maximum time to complete one search taskt the actual time of useto complete one search taskz moving distance of searching equipment in everysmall squarei4. Model One:4.1 Analysis ofModelThe aircraft will fall down after the engine lost power.At this time, the forces of the aircraft are shown in Figure 1. There are the gravity G , rising force F of the aircraft from the air and resistance f of the aircraft from the air.FfGFigure 1the Forces of the AircraftThe acceleration of the aircraft is resolved into horizontal acceleration and vertical acceleration.Thenweestablished dynamic equations in the plane coordinate system.The dynamic equations are:xyf Ma G F Ma =-=Moreover,accelerations are defined as:2222,x y d x d y a a dt dt==By referring to material,we knew about the formulas below.21221212w x u yf C S v F C S v ρρ==4.2 Model BuildingConsequently,the model can be summarized as the differential equations below.222222112122dx d x C S M w dt dt dy d yC S Mg M u dt dt ρρ⎧⎛⎫=⎪ ⎪⎪⎝⎭⎨⎛⎫⎪=- ⎪⎪⎝⎭⎩ The initial conditionsare described as follow:()()00240,000,010000t t dx dy dt dt x y ==⎧==⎪⎨⎪==⎩4.3 Solutions to the ModelBy looking for information,we acquired relevant information of Malaysia Airlines MH370 as shown in Table 2.Table 2 Related Parameters of MH370Use MATLAB to solve the equations.It takes 81.9071 seconds for MH370to crash into the sea.When it crashed into the sea,itsspeedin the horizontal direction is167.3729 minutes per second and speed in the vertical direction is 138.6997 minutes per second.Besides,its Abscissa X is 16328 meters while ordinate Y is 0.0062 meters. Additionally,we obtained curve of solutions for the equations by MATLAB .The crashed track of MH370 is shown in Figure 2.Figure 2the Crashed Track of MH3700.20.40.60.81 1.2 1.4 1.61.82x 104010002000300040005000600070008000900010000Horizontal distance/meterV e r t i c a l d i s t a n c e /m e t e rM 200000kg30.849/kg mw C 0.08 u C1.21S2130m 2S2200m4.4 Testing the ModelIn the Aircraft Crashed Model, we cannot calculate the exact crashed time of the plane due to a computer error. But the error is within a certain range(0.62%), and therefore results of the model are with higher confidence.5. Model Two:the Maritime Search Model5.1 Analysis of ModelIn Model One, we determined the theoretical placement of the aircraft.However, it may still be some distance aheadafter the plane lost contact with the flight.So it is possible to translate the theoretical impact point forward along the original direction of flight of the aircraft.Regard the round having a circle of theoretical placement and a radius of twenty kilometers as the search area.Then round collections whose circles are in a straight line are set as the possible search area, shown in Figure 3.Figure 3 Searching AreaIn order to facilitate the solution to the problem, we make this area approximately a rectangular region, as shown in Figure 4.Figure 4 Rectangle Area of SearchingThis area is divided into small squares with the number of N . What ’s more, we suppose the event ()1,2,,i B i N = stands for the incident that the aircraft is in the small square i and the event A represents the incident that the plane crashed. Therefore, the probability of the plane crashed just into a small square i .()()()i i P A B P B P A B ⋂=Material that we have found shows that:()1i z wi P A B e-=-Here, we assumed that the probability of search at first time.()1,1,2,,i P B i N N==5.2 B ayesian MethodsBayesian analysis, a method of statistical inference (named forEnglish mathematician Thomas Bayes) that allowsone to combine prior information about a population parameter with evidence from information contained in a sample to guide the statistical inference process. A prior probability distribution for a parameter of interest is specified first. The evidence is then obtained and combined through an application of Bayesian theorem to provide a posteriorprobability distribution for the parameter. The posteriordistribution provides the basis for statistical inferences concerning the parameter.The Bayes Formula is represented as follow:1()(|)()(|)(1,2,,)()(|)()i i i i n i i i P A B P B A P A P A B i n P B P B A P A =⋂===∑5.3 Model Building ● Optimization ModelAs a result, we have come to the optimization model search.()()()()(1)(1)()(1)(1)()max 1.,,{1,2,,}n n in x x z wi i i x i x x i i x n f P A B P B e z vT st x x N -===⎛⎫=⋂=- ⎪⎝⎭⎧≤⎪⎨⎪∈⎩∑∑∑● Information UpdatingThe first t + 1 time search, we have to update the probability of the incident according to existing information.The corresponding formulas are represented as follow.As for the small square area having been searched in the first t time search:()()(1)(1)()1{,}()()()ijn n z wt i t i z x wt j t j j x j x x eP B P B eP B P B -+-=∉=+∑∑As for the small square area having not been searched in the first t time search:()()(1)(1)()1{,}()()()j n n t i t i z x wt j t j j x j x x P B P B eP B P B +-=∉=+∑∑6. Model Three: the Search DevicesScheduling Model6.1 Analysis of ModelWe regarded minimum costsas the goal of the model. From this, we can create scheduling model of the search appliances.6.2 Building the ModelBased on the goal of minimum costs, we established scheduling model of the search equipment.121122024300min C =xc t yc t v w t x v w t y S t Txy x a y b ++≥⎧⎪≤⎪⎪≥⎨⎪≤≤⎪⎪≤≤⎩6.3 Model SolvingThrough relevant information, we set some parameters as follow.There are ten aircrafts with the cost of one hundred dollars per hour, a search speed of seven hundred kilometers per hour and the sweep width of one kilometer. There are thirty vessels with the cost of thirty dollars per hour, a search speed of one hundred kilometers per hour and the sweep width of one kilometer.The total search area is 8100 square kilometers and search tasks must be completed within fifteen days.With the LINGO software,we calculated the optimal scheduling scheme: nine aircrafts, three ships. Thus it took 1.23 hours to accomplish search tasks and the smallest search cost is 1,215 dollars7. Conclusions● the Aircraft Crashed ModelBy referring to material, the horizontal velocity and vertical velocity of the airplane cannot disintegrate the plane when it crashed. The assumption that the airplane did not explode has been proved reasonable.But in reality, when the aircraft's engine failed, the pilot would lower theaircraft nose.The aircraft glide a distance as well.Thus falling direction of the aircraft was not level.As a result, there exists a certain bias between the calculation results of the model and the actual situation.● the Maritime Search ModelAfter determining maritime search area, due to the complex situation at sea, when we first searched for the location information of the aircraft, we made no more accurate inference.Therefore, we thought that the probability that the aircraft appeared in any point of search area is the same. So before the first search, all the waters aretheoretically equal area most likely to find the location of the aircraft.If the aircraft is not found after the first end of the search, then we used Bayesian approach to update the probability of finding the aircraft in each region. We re-solved the maritime search model.As expected,we found the aircraft position and the sea search path of the maximum probability.●the Search DevicesScheduling ModelAccording to the actual situation, the best scheduling solution is using nine aircrafts and three ships.This scheme can ensure the completion of the search task with minimal costs. But how much actual work time spent searching is a more important factor, it was not taken into consideration in the program given above.8. Strength and Weakness8.1Model OneStrength●The model is reasonable by model testing.●Solutions to the differential dynamic equations we established are easy toimplement.●We have found the theoretical crashed placement of Malaysia AirlinesMH370.Weakness●Only the method of calculating crashed site is given.●There are no discussions about the possible region that the aircraft may fellinto.8.2Model TwoStrength●Basedon Bayesian methods, we have proposed the practical detectionprobability model.●Discuss the crash probability at various points in the searching area.Weakness●We possibly found additional information about the new discovery ofaircraft debris and the location of black box signal. Additionalinformationhad an effect on Bayesian Information updating. Furthermore, it was nottaken into consideration.8.3Model ThreeStrength●Regard minimalcosts as the goal.●Discuss the dispatch of search and rescue equipmentWeakness●The model may lead to a waste of time owing to the blind pursuit oflowcosts.9. References[1]The Aircraft Lost Contact Search Program Based on Differential Equations and NonlinearProgramming[EB/OL]./link?url=pZh0bMYn_L52FQbTUhqdnqb6pz6pztQ8AqogpF_ E6XVQoOyrotdHIUR1soKPU2FlI5kXdzjana6oIA7Wpn7TG2KVFESRN5J9NrRz9 YG8CPS. 2015-11-2[2]Zhou Changyin, Zhao Yutang, Sun Yaxing.Updating Crashed Plane Detection Probability Model Based on Bayesian Information [J] mathematical modeling and its applications, 2015,4 (2): 71-78[3]Wu ing Mathematical Methods to Find theWreckage[J]. Science Humanities.[4]The Problem of Finding the Black Box Model Based on Maritime Search and GlobalOptimization[EB/OL]./link?url=KrdxNu5Dwuv7iltDrKzx1OQxK1u89X5TqfgUT_F zeORa4jACo_FQAdVu7oIqsIfXO903eHOIYp3RkMXRjx4nR9Pm6X1R4VhXrDt6g TttIWe. 2015-9-610. Paper Concerning Future SearchPlansOn March 8th of 2014,Malaysia Airlines MH370 burst out crashing at twenty-two past oneof Malaysia Local Time. It lost contact with Air Traffic Control during a transition of airspace between Malaysia and Vietnam whilst en-route to Beijing.There were 227 passengers,2 flight crews and 10 cabin crews on board.Today, standing here, we must first extend our deepest apologies to families of the victims, we will try to find the truth about the crash with the fastest speed at all costs to give an account of the victims.For the future of search, we developed a rigorous program, which is divided into three stages: find the general area of the aircraft crashed in the sea, search the most likely location of aircraft in this area, and find equipment and personnel participating in the search arrangements search for work in a timely manner. Next I will describe the three stages in detail:First of all, through studying historical data and information returned before the crash, we identified the aircraft may fall on a rectangular sea. Due to the large area of this sea, we try to find a small sea where the plane is available with the most possibility, in order to ensure the timeliness of search efforts, we mainly use aircraft to search with the aid of ship and work immediately after the best scheduling solution decided, we will continue to repeat the process until we find the crashed plane eventually.We once again express our sympathy to all those who have been affected by the terrible accident. It has been a hard time for all who have tried their best in the search for MH370.We have never wavered in our commitment to continue our efforts to find MH370 and bring closure for everyone, most of all for the families of the passengers and crew of MH370.11. AppendixSolving the plane crashed Model:function [k,vx,vy,xx,yy]=zhuiluo(t0)for t=t0:0.0001:90if(20000-(-7000/849*283^(1/2)*t+5000000/2547*log(1/2*exp(2547/500+21/2500*28 3^(1/2)*t)+1/2*exp(2547/500)))<=0)k=t;break;endendt=0:0.0001:k;x=500000000/11037*log(33111/6250000.*t+1);y=20000-(-7000/849*283^(1/2).*t+5000000/2547*log(1/2*exp(2547/500+21/2500*2 83^(1/2).*t)+1/2*exp(2547/500)));plot(x,y);xx=500000000/11037*log(33111/6250000*k+1);yy=20000-(-7000/849*283^(1/2)*k+5000000/2547*log(1/2*exp(2547/500+21/2500* 283^(1/2)*k)+1/2*exp(2547/500)));vx=240/(33111/6250000*k+1);vy=7000/849*283^(1/2)-7000/849*283^(1/2)*exp(2547/500+21/2500*283^(1/2)*k)/( 1/2*exp(2547/500+21/2500*283^(1/2)*k)+1/2*exp(2547/500));axis([0,20000,0,10000]);grid on;xlabel('Horizontal distance/meter');ylabel('Vertical distance/meter');legend('Plane crashed track');Find the best possible position of aircraft:model:sets:num/1..81/:x;endsetsmax=@sum(num(i):1/810-1/810*e^(-0.01*x(i)));@for(num(i):@sum(num(j):x(j))=300);@for(num:@GIN(x));endThe optimal scheduling program of search device:model:sets:num/1/:x,y,t;endsetsmin=@sum(num:100*x*t+30*y*t);@for(num:700*t*x+100*y*t>=8100);@for(num:t<=24*15);@for(num:y>=x/3);@for(num:@GIN(x);@GIN(y););@for(num:@BND(0,x,10);@BND(0,y,30));end。