美赛历年题目_pdf
42016美赛题目(模拟赛题目)(2021年整理精品文档)
42016美赛题目(模拟赛题目)(可编辑修改word版)编辑整理：尊敬的读者朋友们：这里是精品文档编辑中心，本文档内容是由我和我的同事精心编辑整理后发布的，发布之前我们对文中内容进行仔细校对，但是难免会有疏漏的地方，但是任然希望（42016美赛题目(模拟赛题目)(可编辑修改word版)）的内容能够给您的工作和学习带来便利。
同时也真诚的希望收到您的建议和反馈，这将是我们进步的源泉，前进的动力。
本文可编辑可修改，如果觉得对您有帮助请收藏以便随时查阅，最后祝您生活愉快业绩进步，以下为42016美赛题目(模拟赛题目)(可编辑修改word版)的全部内容。
2016年美赛A题热水澡一个人用热水通过一个水龙头来注满一个浴缸，然后坐在在浴缸中,清洗和放松.不幸的是，浴缸不是一个带有二次加热系统和循环喷流的温泉式浴缸，而是一个简单的水容器。
过一会儿,洗澡水就会明显地变凉,所以洗澡的人需要不停地将热水从水龙头注入，以加热洗浴水。
该浴缸的设计是以这样一种方式，当浴缸里的水达到容量极限，多余的水通过溢流口泄流。
考虑空间和时间等因素，建立一个浴缸的水温模型，以确定最佳的策略，使浴缸里的人可以用这个模型来让整个浴缸保持或尽可能接近初始的温度，而不浪费太多的水。
使用你的模型来确定你的策略对浴缸的形状和体积，浴缸里的人的形状、体积、温度，以及浴缸中的人的运动等因素的依赖程度。
如果这个人一开始用了一种泡泡浴剂加入浴缸，以协助清洗，这会怎样影响你的模型的结果？除了要求的一页MCM摘要提交之外，你的报告必须包括一页的为浴缸用户准备的非技术性的说明书来阐释你的策略,同时解释为什么洗澡水的温度得到均衡地保持是如此之难。
2016年美赛B题太空垃圾在地球轨道上的小碎片的数量已引起越来越多的关注。
据估计，目前有超过500，000块的空间碎片，也被称为轨道碎片，由于被认为对空间飞行器是潜在的威胁而正在被跟踪。
2009年2月10日，俄罗斯卫星kosmos—2251和美国卫星iridium-33相撞之后，该问题受到了新闻媒体更广泛的讨论。
(完整)数学建模美赛试题
地球资源的消耗速度快,越来越多的人关注人类社会的未来。
自1960年以来，已经有许多专家研究可持续发展。
然而大多数人的研究对象是整个世界，一个国家或一个地区。
几乎没有人选择48个最不发达国家(LDC)在联合国为研究对象列表。
然而，LDC国家集团共享许多相同的点.他们的发展道路也有法律的内涵。
本文选择这些国家为研究对象针对发现常规的可持续发展道路。
本文组织如下。
第二部分介绍研究的背景和本研究的意义。
第三节描述了我们对可持续发展的理解细节和显示我们的评估系统的建立过程和原理，那么我们估计每一个国家的LDC和获得可持续发展的能力和等级。
第四节提供了一个最糟糕的国家毛里塔尼亚计划指数在第三节。
第五节演示了在第四节的合理性和可用性计划。
最后在第六节总结本文的主要结论和讨论的力量和潜在的弱点。
地球上的资源是有限的。
三大能源石油、天然气和煤炭可再生。
如何避免人类的发展了资源枯竭和实现可持续发展目标是现在的一个热门话题。
在过去的两个世纪，发达国家已经路上,先污染,再控制和达到高水平的可持续发展。
发展中国家希望发展和丰富。
然而,因为他们的技术力量和低水平的经济基础薄弱，浪费和低效率的发展在这些国家是正常的.所以本文主要关注如何帮助发展中国家特别是48在联合国最不发达国家实现可持续发展是列表可持续发展的理解是解决问题的关键。
可持续发展的定义经历了一个长期发展的过程.在这里,布伦特兰可持续发展委员会的简短定义的”能力发展可持续- - — - - -以确保它既满足现代人的需求又不损害未来的能力代来满足自己的需求”[1]无疑是最被广泛接受的一个在各种内吗定义。
这个定义方面发挥了重要作用在很多国家的政策制定的过程。
然而,为了证明一个国家的现状是否可持续不可持续的,更具体的定义是必要的更具体的概念，我们认为,如果一个国家的发展是可持续的，它应该有一个基本的目前的发展水平，一个平衡的国家结构和一个光明的未来.基本的发展水平反映了国家的基础和潜力。
2003年美国大学生数学建模竞赛题目
2003年美国大学生数学建模竞赛题目问题A: 特技演员影片在拍摄中影片在拍摄中, , , 一个激动人心的动作场景将要摄入镜头一个激动人心的动作场景将要摄入镜头一个激动人心的动作场景将要摄入镜头, , , 而你是特技协而你是特技协调员调员! ! ! 一位特技演员驾驶着摩托车跨越一头大象，一位特技演员驾驶着摩托车跨越一头大象，随后跌落在借以缓冲的一堆纸箱上一堆纸箱上. . . 你需要保护特技演员你需要保护特技演员你需要保护特技演员,,而且而且, , , 也要使用相对而言较少的纸箱也要使用相对而言较少的纸箱（较低的花费（较低的花费, , , 不能进入镜头不能进入镜头不能进入镜头, , , 等等）。
等等）。
你的工作如下：? 确定所用纸箱的大小确定所用纸箱的大小确定所用纸箱的数目确定所用纸箱的数目? 确定纸箱的堆放办法确定纸箱的堆放办法? 还请确定还请确定还请确定, , , 通过对纸箱的各种调整通过对纸箱的各种调整通过对纸箱的各种调整, , , 是否会有所帮助是否会有所帮助? 请把你的研究推广到不同组合重量（特技演员请把你的研究推广到不同组合重量（特技演员请把你的研究推广到不同组合重量（特技演员 & & & 摩托车）和不同跨越摩托车）和不同跨越高度的情形留心一下留心一下, , , 在影片“明日帝国”中，角色在影片“明日帝国”中，角色James Bond Bond 驾驶着摩托车飞过驾驶着摩托车飞过一架直升机一架直升机. .问题B: Gamma 刀治疗方案立体定位放射外科立体定位放射外科, , , 用单一高剂量离子化射束在用单一高剂量离子化射束在X 光机精确界定下照射颅内的一个小的3D 脑瘤脑瘤, , , 与此同时与此同时与此同时, , , 并没有处方剂量的任何显著份额伤并没有处方剂量的任何显著份额伤及周边的脑组织及周边的脑组织. . . 在这个领域中在这个领域中在这个领域中,,一般有三种形式的射束可以采用，分别是Gamma 刀单元刀单元, , , 带电重粒子射束带电重粒子射束带电重粒子射束, , , 以及来自直线加速器的外用高能光以及来自直线加速器的外用高能光子束子束. .Gamma 刀单元具备的单一高剂量离子化射束刀单元具备的单一高剂量离子化射束, , , 是是201个钴个钴-60-60单位源通过厚重的盔状物发射出来的。
2013年美赛真题题目
现在需要他们的解决方案文件太solutions@为Word或PDF附件的电子邮件提交电子副本（汇总表和解决方案）队（由学生或者指导教师）。
COMAP的提交截止日期为2013年2月4日美国东部时间下午8:00，必须在收到您的电子邮件。
主题行COMAP是你的控制示例：COMAP 11111点击这里下载PDF格式的完整的竞赛说明。
点击这里下载Microsoft Word中的格式汇总表的副本。
*请务必变更控制之前选择打印出来的页面的数量和问题。
团队可以自由选择之间MCM问题MCM问题A，B或ICM问题C.COMAP镜像站点：更多：/undergraduate/contests/mcm/MCM：数学建模竞赛ICM：交叉学科建模竞赛2013年赛题MCM问题问题A：终极布朗尼潘当在一个矩形的锅热烘烤时的4个角落中浓缩，并在拐角处（以及在较小程度上在边缘处）：产品会过头。
在一个圆形盘的热量被均匀地分布在整个外缘和在边缘处的产品不过头。
然而，因为大多数烤炉使用圆形平底锅的形状是矩形的是效率不高的相对于使用在烘箱中的空间。
开发一个模型来显示横跨平底锅平底锅不同形状 - 矩形之间的圆形和其他形状的外边缘的热量分布。
假设1。
的宽度与长度之比的W / L的形状是矩形的烘箱。
2。
- 每个盘必须具有的区域A的3。
最初，两个机架在烤箱，间隔均匀。
建立一个模型，可用于选择最佳的泛类型（形状）在下列情况下：1。
适合在烤箱的锅，可以最大限度地提高数（N）2。
最大限度地均匀分布热量（H），泛3。
优化的组合的条件（1）和（2）式中的权重p和（为1 - p）被分配的结果来说明如何随不同的值的W / L和p。
在除了MCM格式解决方案中，准备一到两页的广告片的新布朗尼美食杂志突出自己的设计和结果。
问题B：水，水，无处不在新鲜的白开水是在世界大部分地区的发展限制约束。
建立一个数学模型，为确定有效的，可行的和具有成本效益的水资源战略于2013年，以满足预计的用水需求，从下面的列表]中选择一个国家，到2025年，确定最佳的水战略。
2009-2013美赛建模题目
2009 Contest ProblemsMCM PROBLEMSPROBLEM A: Designing a Traffic CircleMany cities and communities have traffic circles—from large ones with many lanes in the circle (such as at the Arc de Triomphe in Paris and the Victory Monument in Bangkok) to small ones with one or two lanes in the circle. Some of these traffic circles position a stop sign or a yield sign on every incoming road that gives priority to traffic already in the circle; some position a yield sign in the circle at each incoming road to give priority to incoming traffic; and some position a traffic light on each incoming road (with no right turn allowed on a red light). Other designs may also be possible.The goal of this problem is to use a model to determine how best to control traffic flow in, around, and out of a circle. State clearly the objective(s) you use in your model for making the optimal choice as well as the factors that affect this choice. Include a Technical Summary of not more than two double-spaced pages that explains to a Traffic Engineer how to use your model to help choose the appropriate flow-control method for any specific traffic circle. That is, summarize the conditions under which each type of traffic-control method should be used. When traffic lights are recommended, explain a method for determining how many seconds each light should remain green (which may vary according to the time of day and other factors). Illustrate how your model works with specific examples.MCM2009问题A : 设计一个交通环岛在许多城市和社区都建立有交通环岛，既有多条行车道的大型环岛（例如巴黎的凯旋门和曼谷的胜利纪念碑路口），又有一至两条行车道的小型环岛。
美赛题目1985-2007
1985 A J 动物群体的常微分方程.pdf1985 A J 动物群体的管理.pdf1985 A O An Effective Method for Harvesting Salmon.pdf1985 A O Grizzly Bears in Yellowstone National Park.pdf1985 A O Population Dynamics of Deer.pdf1985 A O Population Dynamics of The Peruvian Anchovy.pdf1985 B J B题的若干知识.pdf1985 B J 战略物资的存贮管理.rar1985 B O Managing a Cobalt Stockpile.pdf1985 B O The Problem of Managing a Strategic Reserve.pdf1986 A O Contour Interpolation of Random Data.pdf1986 A O Contouring of Hydrographic Data.pdf1986 A O Interpolating a Topographical Map of The Ocean Floor.pdf 1986 A O Spline Analysis of Hydrographic Data.pdf1986 A O 水道测量数据.pdf1986 B J 应急设施位置.pdf1986 B J 应急设施的优化选址问题.pdf1986 B J 应急设施的位置.pdf1987 A J 盐的贮存.pdf1987 A O The Salt Problem—Making a Mountain Out of Molehills.pdf 1988 A J 关于毒品走私船位置问题的数学模型.pdf1988 B J 两辆平板车的装载问题.pdf1988 B J 两辆铁路平板车的装货问题.pdf1988 B O Locating a Drug Runner Miami Vice Style.pdf1989 A J 判别分析和蠓虫分类.pdf1989 A J 蠓的分类.pdf1989 A O Neural-Network Approach to Classification Problems.pdf 1989 B J 飞机起飞的最优次序.pdf1990 A J 扩散问题的偏微分方程模型.pdf1990 A J 精神病用药问题.pdf1990 A J 试题分析.pdf1990 A O Error-Function Diffusion A Dopamine–Fick’s Model.pdf 1990 B J 扫雪问题.pdf1990 B J 扫雪问题的数学模型.pdf1991 A J 估计水箱的水流量.pdf1991 A J 估计水箱的水流量模型.pdf1991 A J 水塔水流量估计.pdf1991 A J 逼近观察数据的一些样条模型.pdf1991 B J 可靠网络中生成树的优化模型.pdf1991 B J 最小Steiner生成树.pdf1991 B J 最小费用斯坦纳树的构造.pdf1991 B O Finding Optimal Steiner Trees.pdf1991 B P 水塔流量估计.rar1992 B J 应急电力修复系统的修复计划.pdf1992 B O Development of an Emergency-Response System.pdf1993 A J 通过数学建模解决混合物转化为有机肥最佳过程问题.pdf1993 A O Coal-Tipple Operations.pdf1993 B J 倒煤台的操作方案.pdf1993 B J 煤车装卸系统的优化操作.PDF1994 A J 房屋隔热经济效益核算.pdf1994 B J 计算机网络的最小接通时间.pdf1994 B J 计算机网络的最短传输时间.pdf1994 B M 信息传递最少用时的数学模型.pdf1994 B O Talking Fast Finding the Makespan of a Communications Network.pdf1995 A C Author’s Commentary The Outstanding Helix Intersections Papers.pdf1995 A JC 单个的螺旋线.pdf1995 A O A Specialized Root-Finding Method for Rapidly Determining the Intersections of a Plane and a Helix.pdf1995 A O Planes and Helices.pdf1995 A O The Single Helix.pdf1995 B H 学院教师的付薪方案.pdf1995 B L 工资调整系统.pdf1995 B L 教员工资分配调整方案.pdf1995 B O How to Keep Your Job as Provost.pdf1995 B O Long-Term and Transient Pay Scale for College Faculty.pdf1995 B O Paying Professors Wha t They’re Worth.pdf1995 B O The World’s Most Complicated Payroll.pdf1996 A J The Outstanding Helix Intersections Papers.pdf1996 A M 利用环境噪声场探测无自噪声潜艇.pdf1996 A O Detection of a Silent Submarine.pdf1996 A O Gone Fishin.pdf1996 A O How to Locate a Submarine.pdf1996 A O Imaging Underwater Objects with Ambient Noise.pdf1996 A P The Outstanding Submarine Location Papers.pdf1996 B J The Outstanding Contest Judging Papers A.pdf1996 B J The Outstanding Contest Judging Papers B.pdf1996 B JC 竞赛择优问题.pdf1996 B JC 竞赛评卷仿真.pdf1996 B M 快速评卷的方案设计.pdf1996 B M 竞赛评判问题.pdf1996 B O Judging a Mathematics Contest.pdf1996 B O Modeling Better Modeling Judges.pdf1996 B O Select the Winners Fast.pdf1996 B O The Inconsistent Judge.pdf1996 B O The Paper Selection Scheme Simulation Analysis.pdf1997 A H 恐龙的追逐捕食模型.pdf1997 A J The Outstanding Velociraptor Papers.pdf1997 A O A Three-Phase Model for Predator–Prey Analysis.pdf1997 A O Lunch on the Run.pdf1997 A O Modeling Optimal Predator and Prey Strategies.pdf1997 A O Pursuit–Evasion Games in the Late Cretaceous.pdf1997 A O The Geometry and the Game Theory of Chases.pdf1997 B J The Outstanding Discussion Groups Papers.pdf1997 B M The Well-Mixed Assignments.pdf1997 B M 有效讨论的最优混合解.pdf1997 B O A Greedy Algorithm for Solving Meeting Mixing Problems.pdf1997 B O An Assignment Model for Fruitful Discussions.pdf1997 B O Meetings Bloody Meetings.pdf1997 B O Using Simulated Annealing.pdf1997 B P The Outstanding Discussion Groups Papers.pdf1998 A J Judge's Commentary The Outstanding Scanner Papers.pdf1998 A M A Quick Algorithm for MRI Problem.pdf1998 A M Image Reconstruction in MRI.pdf1998 A O A Method for Taking Cross Sections of Three-Dimensional Gridded Data.pdf1998 A O A Model for Arbitrary Plane Imaging, or the Brain in Pain Falls Mainly on the Plane.pdf1998 A O A Tricubic Interpolation Algorithm for MRI Image Cross Sections.pdf1998 A O MRI Slice Picturing.pdf1998 A P Proposer's Commentary The Outstanding Scanner Papers.pdf1998 B H Place Students in Deciles Reasonably.pdf1998 B O A Case for Stricter Grading.pdf1998 B O Alternatives to the Grade Point Average for Ranking Students.pdf1998 B O Grade Infation A Systematic Approach to Fair Achievement Indexing.pdf1998 B O Judge's Commentary The Outstanding Grade Inflation Papers.pdf1998 B P Practitioner's Commentary The Outstanding Grade Inflation Papers.pdf1999 A H The Assessment Metheod of Impact.pdf1999 A O Antarctic Asteroid Effects.pdf1999 A O Asteroid Impact at the South Pole A Model-Based Risk Assessment.pdf1999 A O Not an Armageddon.pdf1999 A O The Sky is Falling.pdf1999 B H How to Calculate the Lawful Capacity in the Constraied Condition.pdf1999 B H How to Calculate the Lawful Capcity in the Constrained Condition .pdf1999 B J Judge's Commentary The Outstanding Lawful Capacity Papers.pdf1999 B O Determining the People Capacity of a Structur.pdf1999 B O Don't Panic.pdf1999 B O Hexagonal Unpacking.pdf1999 B O Room Capacity Analysis Using a Pair of Evacuation Models.pdf1999 B O Standing Room Only.pdf2000 A J Judge's Commentary The Outstanding Air Traffic Control Papers.pdf2000 A M Channel Assignment Strategies for Cellular Phone Systems.pdf2000 A M The Model For Measuring Complexity of Air Traffic Control Predicting and Adjusting Path Conflicts.pdf2000 A O Air Traffic Control.pdf2000 A O The Iron Laws of Air Traffic Control.pdf2000 A O The Safe Distance Between Airplanes and the Complexity of an Airspace Sector.pdf 2000 A O You Make the Call Feasibility of Computerized Aircraft Control.pdf2000 B J Author Judge's Commentary The Outstanding Channel Assignment Papers.pdf2000 B O A Channel Assignment Model The Span Without a Face.pdf2000 B O Groovin'with the Big Band(width).pdf2000 B O Radio Channel Assignments.pdf2000 B O Utilize the Limited Frequency Resources Efficiently.pdf2000 B O We're Sorry,You're Outside the Coverage Area.pdf2000 C J Judge's Commentary The Outstanding Elephant Population Papers.pdf2000 C O A Computational Solution for Elephant Overpopulation.pdf2000 C O EigenElephants When Is Enough,Enough.pdf2000 C O Elephant Population A Linear Model.pdf2001 A J Author-Judge's Commentary The Outstanding Bicycle Wheel Papers.pdf2001 A O A Systematic Technique for Optimal Bicycle Wheel Selection.pdf2001 A O Can’t Quite Put Our Fin ger On It.pdf2001 A O Selection of a Bicycle Wheel Type.pdf2001 A O Spokes or Discs.pdf2001 A P Choosing a Bicycle Wheel.zip2001 B M Strategies for Escaping a Hurricane's Wrath.zip2001 B H Hurricane Evacuation .pdf2001 B J Judge's Commentary The Outstanding Hurricane Evacuation Papers.pdf2001 B M What If Another Floyd Escaping a Hurricane's Wrath.pdf2001 B M When a Hard Wind Blows the Traffic Slows.pdf2001 B O Jammin'with Floyd A Traffic Flow Analysis of South Carolina Hurricane Evacuation.pdf2001 B O Please Move Quickly and Quietly to the Nearest Freeway.pdf2001 B O Project H.E.R.O. Hurricane Evacuation Route Optimization.pdf2001 B O The Crowd Before the Storm.pdf2001 B O Traffic Flow Models and the Evacuation Problempdf.pdf2001 B P 飓风来临的最佳疏散方案.rar2001 C J Judge’s Commentary The Outstanding Zebra Mussel Papers.pdf2001 C O A Multiple Regression Model to Predict Zebra Mussel Population Growth.pdf 2001 C O Identifying Potential Zebra Mussel Colonization.pdf2001 C O Waging War Against the Zebra Mussel.pdf2002 A J Judge’s Commentary The Outstanding Wind and Waterspray Papers.pdf2002 A M Blowin'in the Wind.pdf2002 A M Fountain Spray as a Particle Model.pdf2002 A M Woner Control Beautiful Foutain.rar2002 A O A Foul Weather Fountain.pdf2002 A O Simulating a Fountain.pdf2002 A O The Fountain That Math Built.pdf2002 A O Wind and Waterspray.pdf2002 B H How much to overbook this flight.zip2002 B J Judge’s Commentary The Outstanding Airline Overbooking Papers.pdf2002 B M Whole.rar2002 B O ACE is High.pdf2002 B O Overbooking on Airlines.pdf2002 B O Probabilistically Optimized Airline Overbooking Strategies.pdf2002 B O The Airline Overbooking Problem.pdf2002 B O Things That Go Bump in the Flight.pdf2002 C M If we Scrub our land too much we may lose the LIZARDs.rar2002 C M Life Model of Florida Scrub Lizard.rar2002 C O Cleaning Up the Scrub Saving the Florida Scrub Lizard.pdf2002 C O Where's the Scrub Aye,There's the Rub.pdf2003 A H Shaken, not Stirred.pdf2003 A M The Stunt Person.rar2003 A O Cardboard Comfortable When it comes to Crashing.pdf2003 A O Safe Landings.pdf2003 A O Thinking Outside the Box and Over the Elephant.pdf2003 A O You Too Can Be James Bond.pdf2003 A P Design and Stack the Cardboard Boxes.pdf2003 A P The design of the buffer cardboard boxes.pdf2003 B M Optimization of Stereotactic Radiosurgery Treatment Planning.pdf2003 B O Shelling Tumors with Caution and Wiggles.pdf2003 B P Shelling Procedure and Optimization by Simulated Annealing For Sphere Packing.pdf 2003 C H Aviation Baggage Screening.pdf2003 C H Security Screening at Airport.pdf2003 C H To Screen or Not.pdf2003 C M Aviation Baggage Screening Smart Approach to Screen.rar2003 C P Aviation Baggage Screening.pdf2004 A J Editor's Commentary Fingerprint Identification .pdf2004 A J Judge's Commentary The Outstanding Fingerprints Papers.pdf2004 A J Publisher's Editorial The Good Fight.pdf2004 A M Are Fingerprints Unique.pdf2004 A M Are Fingerprints Unique.rar2004 A M Fe-Fi-Fo Thumb.pdf2004 A O Can't Quite Put Our Finger On It.pdf2004 A O Not Such a Small Whorl After All.pdf2004 A O The Myth of The Myth of Fingerprints.pdf2004 A O Z Rule of Thumb Prints Beat DNA.pdf2004 B H a Faster QuickPass System.pdf2004 B H Magic Regulation Scheme for QuickPass System.pdf2004 B J Editor's Commentary Fingerprint Identification .pdf2004 B J Judges' Commentary The Quick Pass Fusaro Award Paper.pdf2004 B M Virtual Lines in Topoland with these Designs.pdf2004 B O A Myopic Aggregate-Decision Model for Reservation Systems in Amusement Parks.pdf 2004 B O An Adaptive Approach to Virtual Queing.pdf2004 B O Developing Improved Algorithms for QuickPass Systems.pdf2004 B O Developing Improved Algorithms for QuickPass Systems.pdf .pdf2004 B O KalmanQueue An Adaptive Approach to Virtual Queueing.pdf2004 B O Theme-Park Queueing Systems.pdf2004 B O Z Theme Park Simulation with a Nash-Equilibrium-Based Visitor Behavior Model.pdf 2004 B P Make Your Way Faster.pdf2004 B P Optimized QuickPass System.pdf2004 B P You Must Be at Least This Tall to Ride This Paper.pdf2004 C H ?IT Security Keep Hackers and Virus Out.pdf2004 C J Authors' Commentary The Outstanding Information Technology Security Papers.pdf 2004 C J Judge's Commentary The Outstanding Information Technology Security Papers.pdf 2004 C O Catch Thieves Online IT Security.pdf2004 C O Firewalls and Beyond Engineering IT Security.pdf2004 C O It's All About the Bottom Line.pdf2004 C O Making the CIA Work for You.pdf2005 A J Judge's Commentary The Outstanding Flood Planning Papers.pdf2005 A M One Two Step .pdf2005 A O Analysis of Dam Failure in the Saluda River Valley.pdf2005 A O From Lake Murray to a Dam Slurry.pdf2005 A O Through the Breach Modeling Flooding from a Dam Failure in South Carolina.pdf 2005 A O Z Catastrophic Consequences of Earthquake Destruction of the Saluda Dam.pdf 2005 B H For Whom the Booth Tolls .pdf2005 B H Is the Number of Tollbooths Optimal.pdf2005 B H Modeling Toll Plaza Behavior Using.pdf2005 B H Optimal Design of Toll Plaza.pdf2005 B H ?Pass the Plaza more Quickly .pdf2005 B J Judge's Commentary The Outstanding Tollbooths Papers.pdf2005 B M Giving Queueing the Booth.pdf2005 B O A Quasi-Sequential Cellular-Automaton Approach to Traffic Modeling.pdf2005 B O A Single-Car Interaction Model of Traffic for a Highway Toll Plaza.pdf2005 B O For Whom the Booth Tolls.pdf2005 B O Lane Changes and Close Following Troublesome Tollbooth Traffic.pdf2005 B O The Booth Tolls for Thee .pdf2005 B O The Booth Tolls for Thee.pdf2005 B O The Multiple Single Server Queueing System.pdf2005 B O Two Tools for Tollbooth Optimization.pdf2005 C H A Projection of Southeast Alaskan Salmon Populations.pdf2005 C H Between a Rockfish and a Hard Plaice.pdf2005 C H The future of “black gold”.pdf2005 C H When will the oil run out.pdf2005 C J Author's Commentary The Outstanding Exhaustible Resource Papers.pdf2005 C J Editorial Where Else to Publish.pdf2005 C J Judge's Commentary The Outstanding Exhaustible Resource Papers.pdf2005 C O Preventing the Hydrocalypse A Model for Predicting and Managing Worldwide Water Resource.pdf2005 C O The Coming Oil Crisis.pdf2005 C O The Petroleum Armageddon.pdf2006 A H A Simulated Annealing Approach to Irrigation.pdf2006 A H Minimizing Maintenance Cost for Hand-Moved Irrigation Systems.pdf2006 A H On Portable Irrigation Systems .pdf2006 A H Optimal Design of Irrigation Schedule.pdf2006 A J Judge's Commentary The Outstanding Irrigation Problem Papers.pdf2006 A M Optimizing a Handmove Sprinkler System .pdf2006 A M Piping Hot Weather.pdf2006 A M Positioning and Moving Sprinkler Systems for Irrigation.rar2006 A O Fastidious Farmer Algorithms (FFA).pdf2006 A O Fastidious Farmer Algorithms.pdf2006 A O Optimization of Irrigation.pdf2006 A O Z A Schedule for Lazy but Smart Ranchers.pdf2006 A O Z Developing Improved Algorithms for Irrigation Systems.pdf2006 A O Z Optimization of Irrigation.pdf2006 A O Z Sprinkle, Sprinkle, Little Yard.pdf2006 A O Z Sprinkler Systems for Dummies Optimizing a Hand-Moved Sprinkler System.pdf 2006 A P Positioning and Moving Sprinkler Systems for Irrigation .pdf2006 B H The Scheme of the Wheelchair Dispatch and Cost Analysis for Epsilon Airlines.pdf 2006 B H Transfer Suffers NEVER.pdf2006 B J Judges' Commentary The Fusaro Award Wheelchair Paper.pdf2006 B J Special Section on the MCM Judges Commentary The Fusaro Award Wheelchair Paper.pdf 2006 B M Minimal Costs for Serving Disabilities.pdf2006 B M Operational Research for Wheelchair Service Provided by Epsilon Airlines.pdf 2006 B M sly_airport.rar2006 B M When the Model Hits the Runway.pdf2006 B O A Simulation-Driven Approach for a Cost-Efficient Airport Wheelchair Assistance Service.pdf2006 B O Application of Min-Cost Flow to Airline Accessibility Services.pdf2006 B O Z A Simulation-Driven Approach for a Cost-Efficient Airport Wheelchair Assistance Service.pdf2006 B O Z Cost Minimization of Providing a Wheelchair Escort Service.pdf2006 B O Z Minimization of Cost for Transfer Escorts in an Airport Terminal.pdf2006 B O Z Profit Maximizing Allocation of Wheelchairs in a Multi-Concourse Airport.pdf2006 C H Fighting against AIDS.pdf2006 C H War of the World Fight against AIDS.pdf2006 C J Author's Commentary The Outstanding HIV AIDS Papers.pdf2006 C J HIV The Math..pdf2006 C M AIDS A Global Crisis.pdf2006 C O AIDS Modeling a Global Crisis and Australia.pdf2006 C O Managing the HIV AIDS Pandemic 2006-2055.pdf2006 C O Managing the HIVAIDS Pandemic.pdf2006 C O The Spreading HIV AIDS Problem.pdf2006 C O The United Nations and the Quest for the Holy Grail (of AIDS).pdf2006 C O The United Nations and the Quest for the Holy Grail.pdf2007 A H Genetic Algorithm for Non-Partisan Legislative Districting.pdf2007 A O A Cluster-Theoretic Approach to Political Districting.pdf2007 A O Applying Voronoi Diagrams to the Redistricting Problem.pdf2007 A O When Topologists Are Politicians.pdf2007 B H A Practical Approach to Boarding Deboarding an A380.pdf2007 B H The Airplane Seating Problem 2.pdf2007 B H The Airplane Seating Problem.pdf2007 B H 朱姝（自动化）、朱俊华（自动化）、丁金金（信息与计算科学）.pdf2007 B H 陈侠航（数学与应用数学）何军（测控技术与仪器）杨水生（数学与应用数学）.pdf 2007 B M A Quadrilateral Approach to Congressional Districting.pdf2007 B M An Analysis of the Kidney Transplant Network.pdf2007 B O Boarding at the Speed of Flight.pdf2007 B O Novel Approaches to Airplane Boarding.pdf2007 C C Organ Transplant The Kidney Exchange Problem.pdf2007 C H Kidney Exchange.pdf2007 C H Organ Transplant The Kidney Exchange Problem 2.pdf2007 C H Organ Transplant The Kidney Exchange Problem.pdf2007 C H 王教团（信息与计算科学）周朝卫（信息与计算科学）周龙飞（信息管理与信息系统）.pdf 2007 C J Author's Commentary The Outstanding Kidney Exchange Papers.pdf2007 C J Judges' Commentary The Outstanding Kidney Exchange Papers.pdf2007 C J Write Your Own Contest Entry.pdf2007 C M More Kidney Donors More Lives Can Be Saved.pdf2007 C O Analysis of Kidney Transplant System Using Markov Process Models.pdf2007 C O Optimizing the Effectiveness of Organ Allocation.pdf2007 C P Practitioner's Commentary The Outstanding Kidney Exchange Papers.pdf。
历年美赛题目归纳
A B
2014（交通流、路况）优化（体育教练）综合评价
2013热力学、几何（大模型解答所有题目）（水资源）预测、最优化
2012（流程）优化
2011（物理模型）多目标规划（信号传输中继站）目标位置确定2010力学（棒球棒最佳击球点）（系列犯罪地理效应）预测模型
2009（环岛交通流）优化（能源）多目标规划、预测
2008（北极冰融化影响）预测算法设计
2007（选取划分）多目标规划（登机时间）优化、多目标规划
2006（灌溉喷头位置确定）优化，多目标规划（机场轮椅调度）优化、（预算）预测2005（洪流量）预测（收费亭数量和位置确定）目标规划2004（指纹识别）模型、模型比较（时间调度）优化
2003（跳伞）目标规划多目标规划
2002(算法设计)预测模型（飞机Overbooking）优化
2001（自行车轮胎）优化，多目标规划对模型进行分析和优化
2000空间几何，模型分析图论
1999（行星碰撞南极后果）预测（房屋最大人数）多目标规划
1998核磁共振算法设计成绩排名算法设计
1997
1996
1995
1994
1993
1992
1991
1990
1989
1988。
美国(MCM)(ICM)试题(96年-09年)(英文版)
美国大学生数学建模竞赛试题1996 American MCM Problems Problem AThe world's oceans contain an ambient noise field. Seismic disturbances, surface shipping, and marine mammals are sources that, in different frequency ranges,contribute to this field. We wish to consider how this ambient noise might be used to detect large moving objects, e.g., submarines located below the ocean surface. Assuming that a submarine makes no intrinsic noise, developa method for detecting the presence of a moving submarine, its size, and its direction of travel, using only information obtained by measuring changes to the ambient noise field. Begin with noise at one fixed frequency and amplitude.Problem BWhen determining the winner of a competition like the Mathematical Contest inModeling, there are generally a large number of papers to judge. Let's saythere are P=100 papers.A group of J judges is collected to accomplish thejudging. Funding for the contest constains both the number of judges that canbe obtained and amount of time that they can judge. For eample if P=100, thenJ=8 is typical.Ideally, each judge would read paper and rank-order them, but there are toomany papers for this. Instead, there will be a number of screening rounds inwhich each judge will read some number of papers and give them scores. Thensome selection scheme is used to reduce the number of papers under consideration: If the papers are rank-ordered, then the bottom 30% that eachjudge rank-orders could be rejected. Alternatively, if the judges do not rank-order, but instead give them numerical score (say, from 1 to 100),then all papers below some cut-off level could be rejected.The new pool of papers is then passed back to the judges, and the process is repeated.A concern is then the total number of papers that judge reads must besubstantially less than P. The process is stopped when there are only W papersleft. There are the winners. Typically for P=100, W=3.Your task is to determine a selection scheme, using a combination of rank-ordering, numerical scoring, and other methods, by which the final Wpapers will include only papers from among the "best" 2W papers. (By "best",we assume that there is an absolute rank-ordering to which all judges wouldagree.) For example, the top three papers. Among all such methods, the one thatrequired each judge to read the least number of papers is desired.Note the possibility of systematic bias in a numerical scoring scheme. For example, for a specific collection of papers, one judge could average 70points, while another could average 80 points. How would you scale your schemeto accommodate for changes in the contest parameters (P, J, and W)?1997 American MCM ProblemsProblem A The Velociraptor ProblemThe velociraptor,Velociraptor mongoliensis, was a predatory dinosaur that lived during the late Cretaceous period, approximately 75 million years ago. Paleontologists think that it was a very tenacious hunter, and may have hunted in pairs or largerpacks .Unfortunately, there is no way to observe its hunting behavior in the wild as can be done with modern mammalian predators. A group of paleontologists has approached your team and asked for help in modeling the hunting behavior of the velociraptor. They hope to compare your results with field data reported by biologists studying the behaviors of lions, tigers, and similar predatory animals.The average adult velociraptor was 3 meters long with a hip height of 0.5 meters and an approximate mass of 45 kg. It is estimated that the animal could run extremely fast at speed of 60 km/hr for about 15 seconds. After the initial burst of speed ,the animal needed to stop and recover from a buildup of lactic acid in its muscles.Suppose that velociraptor preyed on Thescelosaurus neglectus, a herbivorous biped approximately the same size as the Velociraptor. A biomachanical analysis of a fossilized Thescelosaurus indicates that it could run at a speed of about 50 km/hr. for long period of time.Part1Assuming the velociraptor is a solitary hunter, design a mathematical model that describe a hunting strategy for a single velociraptor stalking and chasing a single Thescelosaurus as well as the evasive strategy of the prey. Assume that the Thescelosaurus can always detect the velociraptor when it comes within 15 meters .but may detect the predator at even greater ranges (up to 50 meters depending upon the habitat and weather conditions. Additionally ,due to its physical structure and strength, the velociraptorhas a limited turning radius when running at full speed. This radius is estimated to be three times the animal's hip height. On the other hand, the Thescelosaurus is extremely agile and has a turning radius of 0.5 meters.Part2Assuming more realistically that the velociraptor hunted in pairs, design a new model that describes a hunting strategy for two velociraptor stalking and chasing a single Thescelosaurus as well as the evasive strategy of the prey. Use the other assumptions and limitations given in Part 1.Problem B Mix Well For Fruitful DiscussionsSmall group meeting for the discussions of important issues, particular long-range planning ,are gaining popularity. It is believed that large groups discourage productive discussion and that a dominant personality will usually control and direct the discussion. Thus ,in corporate board meetings the board will meet in small groups to discuss issues before meeting as a whole, these smaller groups still tun the risk of control by a dominant personality. In an attempt to reduce this danger it is common to schedule several sessions with a different mix of people in each group.A meeting of An Tostal Corporation will be attended by 29 Board Members of which nine are in-house members(i.e., corporate employees).The meeting is to be an all-day affair with three sessions scheduled for the morning and four for the afternoon. Each session will take 45 minutes, beginning on the hour from 9:00 A.M. to 4:00 P.M., with lunch scheduled at noon. Each morning session will consist of six discussion groups with each discussion group led by one of the corporation's six senior officers. None of these officers are board members. Thus each senior officers will not be involved in the afternoon sessions and each of these sessions will consist of only four different discussion groups.The president of the corporation wants a list of board-member assignment to discussion groups for each of the seven sessions. The assignments should achieve as much of a mix of the members as much as possible. The ideal assignment would have each board member in a discussion group the same number of times while minimizing common membership of groups for the different sessions.The assignment should also satisfy the following criteria:1.For the morning sessions ,no board member should be in the same senior officer's discussion group twice.2.No discussion group should contain a disproportionate number of in-house members.Give a list of assignments for members 1-9 and 10-29 and officers 1-6.Indicate how well the criteria in the previous paragraphs are met. Since it is possible that some board members will cancel at the last minute or that some not scheduled will show up, an algorithm that the secretary could use to adjust the assignments with an hour's notice would be appreciated. It would be ideal if the algorithm could also be used to make assignments for future meetings involving different levels of participation for each type of attendee.1998 American MCM ProblemsProblem A MRI ScannersIntroductionIndustrial medical diagnostic machines known as Magnetic Resonance Imager (MRI) scan a three-dimensional object such as a brain, and deliver their results in the form of a three-dimensional array of pixel. Each pixel consists of one number indicating a color or a shade of gray that encodes a measure of water concentration in a small region of the scanned object at the location of the pixel .For instance,0 can picture high water concentration in black (ventricles, blood vessels),128 can picture a medium water concentration in gray(brain nuclei and gray matter),and 255 can picture a low water density in white (liquid-rich white matter consisting of myelinated axons).Such MRI scanners also include facilities to picture on a screen any horizontal or vertical slice through the three-dimensional array (slices are parallel to any of the three Cartesian coordinate axes ).Algorithms for picturing slices through oblique planes ,however ,are proprietary .Current algorithms are limited in terms of the angles and parameter options available ;are implemented only on heavily used dedicated workstations ;lack input capabilities for marking points in the picture before slicing; and tend to blur and "feather out" sharp boundaries between the original pixels.A more faithful, flexible algorithm implemented on a personal computer would be useful.(1)for planning minimally invasive treatments,(2)for calibrating the MRI machines,(3)for investigating structures oriented obliquely in space, such as post-mortem tissue sections in a animal research,(4)for enabling cross-sections at any angle through a brain atlas consisting (4)for enabling cross-sections at any angle through a brain atlas consistingof black-and-white line drawingTo design such an algorithm, one can access the value and locations of the pixels, but not the initial data gathered by the scanners.ProblemDesign and test an algorithm that produces sections of three-dimensional arrays by planes in any orientation in space, preserving the original gray-scale value as closely as possible.Data SetsThe typical data set consists of a three-dimensional array A of numbers A(i,j,k) which indicates the density A(i,j,k) of the object at the location (x,y,z)i,j,k. Typically A(i,j,k) can range from 0 to 255.In most applications the data set is quite large.Teams should design data sets to test and demonstrate their algorithms. The data sets should reflect conditions likely Teams should design data sets to test and demonstrate their algorithms. The data sets should reflect conditions likely to be of diagnostic interest. Teams should also characterize data sets the limit the effectiveness of their algorithms.SummaryThe algorithm must produce a picture of the slice of the three-dimensional array by a plane in space. The plane can have any orientation and any location in space.(The plane can miss some or all data points.)The result of the algorithm should be a model of the density of the scanned object over the selected plane.Problem B Grade InflationBackgroundSome college administrators are concerned about the grading at A Better Class(ABC) college. On average, the faculty at ABC have been giving out high grades(the average grade now given out is an A-),and it is impossible to distinguish between the good and mediocre students .The terms of a very generous scholarship only allow the top 10% of the students to be funded, so a class ranking is required.The dean had the thought of comparing each student to the other students in each class ,and using this information to build up a ranking. For example, if a student obtains an A in a class in which all students obtain an A, then this student is only "average" in this class. On the other hand, if a student obtain the only A in a class, then that student is clearly "above average". Combining information from several classes might allow students to be placed in deciles (top 10%,next 10%,ect.)across the college.ProblemAssuming that the grades given out are(A+,A-,B+,B-,...)can the dean's idea be made to work?Assuming that the grades given out are only (A,B,C,...)can the dean's idea be made to work?Can any other schemes produce a desired ranking?A concern is that the grade in a single class could change many student's deciles. Is this possible?Data SetsTeams should design data sets to test and demonstrate their algorithms. Teams should characterize data sets that limit the effectiveness of their algorithms.Mathematical Contest in Modeling 1999 ProblemsProblem A - Deep ImpactFor some time, the National Aeronautics and Space Administration (NASA) has been considering the consequences of a large asteroid impact on the earth.As part of this effort, your team has been asked to consider the effects of such an impact were the asteroid to land in Antarctica. There are concerns that an impact there could have considerably different consequences than one striking elsewhere on the planet.You are to assume that an asteroid is on the order of 1000 m in diameter, and that it strikes the Antarctic continent directly at the South Pole.Your team has been asked to provide an assessment of the impact of such an asteroid. In particular, NASA would like an estimate of the amount and location of likely human casualties from this impact, an estimate of the damage done to the food production regions in the oceans of the southern hemisphere, and an estimate of possible coastal flooding caused by large-scale melting of the Antarctic polar ice sheet.Problem B - Unlawful AssemblyMany public facilities have signs in rooms used for public gatherings which state that it is "unlawful" for the rooms to be occupied by more than a specified number of people. Presumably, this number is based on the speed with which people in the room could be evacuated from the room's exits in case of an emergency. Similarly, elevators and other facilities often have "maximum capacities" posted.Develop a mathematical model for deciding what number to post on such a sign as being the "lawful capacity". As part of your solution discuss criteria, other than public safety in the case of a fire or other emergency, that might govern the number of people considered "unlawful" to occupy the room (or space). Also, for the model that you construct, consider the differences between a room with movable furniture such as a cafeteria (with tables and chairs), a gymnasium, a public swimming pool, and a lecture hall with a pattern of rows and aisles. You may wish to compare and contrast what might be done for a variety of different environments: elevator, lecture hall, swimming pool, cafeteria, or gymnasium. Gatherings such as rock concerts and soccer tournaments may present special conditions.Apply your model to one or more public facilities at your institution (or neighboring town). Compare your results with the stated capacity, if one is posted. If used, your model is likely to be challenged by parties with interests in increasing the capacity. Write an article for the local newspaper defending your analysis.2000 Mathematical Contest in ModelingProblem A Air traffic ControlDedicated to the memory of Dr. Robert Machol, former chief scientist of the Federal Aviation Agency To improve safety and reduce air traffic controller workload, the Federal Aviation Agency (FAA) is considering adding software to the air traffic control system that would automatically detect potential aircraft flight path conflicts and alert the controller. To that end, an analyst at the FAA has posed the following problems.Requirement A: Given two airplanes flying in space, when should the air traffic controller consider the objects to be too close and to require intervention?Requirement B: An airspace sector is the section of three-dimensional airspace that one air traffic controller controls. Given any airspace sector, how do we measure how complex it is from an air traffic workload perspective? To what extent is complexity determined by the number of aircraft simultaneously passing through that sector (1) at any one instant?(2) during any given interval of time?(3) during a particular time of day? How does the number of potential conflicts arising during those periods affect complexity?Does the presence of additional software tools to automatically predict conflicts and alert the controller reduce or add to this complexity?In addition to the guidelines for your report, write a summary (no more than two pages) that the FAA analyst can present to Jane Garvey, the FAA Administrator, to defend your conclusions.Problem B Radio Channel AssignmentsWe seek to model the assignment of radio channels to a symmetric network of transmitter locations over a large planar area, so as to avoid interference. One basic approach is to partition the region into regular hexagons in a grid (honeycomb-style), as shown in Figure 1, where a transmitter is located at the center of each hexagon.Figure 1An interval of the frequency spectrum is to be allotted for transmitter frequencies. The interval will be divided into regularly spaced channels, which we represent by integers 1, 2, 3, ... . Each transmitter will be assigned one positive integer channel. The same channel can be used at many locations, provided that interference from nearby transmitters is avoided. Our goal is to minimize the width of the interval in the frequency spectrum that is needed to assign channels subject to some constraints. This is achieved with the concept of a span. The span is the minimum, over all assignments satisfying the constraints, of the largest channel used at any location. It is not required that every channel smallerthan the span be used in an assignment that attains the span.Let s be the length of a side of one of the hexagons. We concentrate on the case that there are two levels of interference.Requirement A: There are several constraints on frequency assignments. First, no two transmitters within distance of each other can be given the same channel. Second, due to spectral spreading, transmitters within distance 2s of each other must not be given the same or adjacent channels: Their channels must differ by at least 2. Under these constraints, what can we say about the span in,Requirement B: Repeat Requirement A, assuming the grid in the example spreads arbitrarily far in all directions.Requirement C: Repeat Requirements A and B, except assume now more generally that channels for transmitters within distance differ by at least some given integer k, while those at distance at most must still differ by at least one. What can we say about the span and about efficient strategies for designing assignments, as a function of k?Requirement D: Consider generalizations of the problem, such as several levels of interference or irregular transmitter placements. What other factors may be important to consider?Requirement E: Write an article (no more than 2 pages) for the local newspaper explaining your findings.2001 Mathematical Contest in Modeling (MCM)Problem A: Choosing a Bicycle WheelCyclists have different types of wheels they can use on their bicycles. The two basic typesof wheels are those constructed using wire spokes and those constructed of a solid disk (see Figure 1) The spoked wheels are lighter, but the solid wheels are more aerodynamic.A solid wheel is never used on the front for a road race but can be used on the rear of the bike.Professional cyclists look at a racecourse and make an educated guess as to what kind of wheels should be used. The decision is based on the number and steepness of the hills, the weather, wind speed, the competition,and other considerations. The director sportif of your favorite team would like to have a better system in place and has asked your team for information to help determine what kind of wheel should be used fora given course.Figure 1: A solid wheel is shown on the left and a spoked wheel is shown on the right. The director sportif needs specific information to help make a decision and has asked your team to accomplish the tasks listed below. For each of the tasks assume that the same spoked wheel will always be used on the front butthere is a choice of wheels for the rear.Task 1. Provide a table iving the wind peed at which the power required for a solid rear wheel is less than for a spoked rear wheel. The table should include the wind speeds for different road grades starting from zero percent to ten percent in one percent increments. (Road grade is defined to be the ratio of the total rise of a hill divided by the length of the road. If the hill is viewed as a triangle, the grade is the sine of the angle at the bottom of the hill.) A rider starts at the bottom of the hill at a speed of 45 kph, and the deceleration of the rider is proportional to the road grade.A rider will lose about 8 kph for a five percent grade over 100 meters.Task 2. Provide an example of how the table could be used for a specific time trial courseTask 3. Determine if the table is an adequate means for deciding on the wheel configuration and offer other suggestions as to how to make this decision.Problem B: Escaping a Hurricane's Wrath (An Ill Wind...)Evacuating the coast of South Carolina ahead of the predicted landfallof Hurricane Floydin 1999 led to a monumental traffic jam. Traffic slowed to a standstill on Interstate I-26, which is the principal route going inland from Charleston to the relatively safe haven of Columbia in the center of the state. What is normally an easy two-hour drive took up to 18 hours to complete. Many cars simply ran out of gas along the way.Fortunately, Floyd turned north and spared the state this time, but the public outcry is forcing state officials to find ways to avoid a repeat of this traffic nightmare.The principal proposal put forth to deal with this problem is the reversalof traffic onI-26, so that both sides, including the coastal-bound lanes,have traffic headed inland from Charleston to Columbia. Plans to carry this out have been prepared (and posted on the Web)by the South Carolina Emergency Preparedness Division. Traffic reversal on principal roads leading inland from Myrtle Beach and Hilton Head is also planned.A simplified map of South Carolina is shown. Charleston has approximately 500,000 people, Myrtle Beach has about 200,000 people, and another 250,000 people are spread out along the rest of the coastal strip. (More accurate data,if sought, are widely available.)The interstates have two lanes of traffic in each direction except in the metropolitan areas where they have three. Columbia, another metro area of around 500,000 people, does not have sufficient hotel space to accommodate the evacuees (including some coming from farther northby other routes), so some traffic continues outbound on I-26 towards Spartanburg; on I-77 north to Charlotte; and on I-20 east to Atlanta. In 1999, traffic leaving Columbia going northwest was moving only very slowly. Construct a model for the problem to investigate what strategies may reduce the congestion observed in 1999. Here are the questions that need to be addressed:1.Under what conditions does the plan for turning the two coastal-bound lanes of I-26 into two lanes of Columbia-bound traffic, essentially turning the entire I-26 into one-way traffic, significantly improve evacuation traffic flow?2.In 1999, the simultaneous evacuation of the state's entire coastal region was ordered. Would the evacuation traffic flow improve under an alternative strategy that staggers the evacuation, perhaps county-by-county over some time period consistent with the pattern of how hurricanes affect the coast?3.Several smaller highways besides I-26 extend inland from the coast. Under what conditions would it improve evacuation flow to turn around traffic on these?4.What effect would it have on evacuation flow to establish more temporary shelters in Columbia, to reduce the traffic leaving Columbia?5.In 1999, many families leaving the coast brought along their boats, campers, and motor homes. Many drove all of their cars. Under what conditions should there be restrictionson vehicle types or numbers of vehicles brought in order to guarantee timely evacuation? 6.It has been suggested that in 1999 some of the coastal residents of Georgia and Florida, who were fleeing the earlier predicted landfalls of Hurricane Floyd to the south, came upI-95 and compounded the traffic problems. How big an impact can they have on the evacuation traffic flow? Clearly identify what measures of performance are used to compare strategies. Required: Prepare a short newspaper article, not to exceed two pages,explaining the results and conclusions of your study to the public.问题 A: 选择自行车车轮骑自行车的人有几种不同类型的车轮可以用在他们的自行车上。
- 1、下载文档前请自行甄别文档内容的完整性，平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益，请联系客服反馈,我们会尽快为您处理(人工客服工作时间：9:00-18:30)。
马剑整理历年美国大学生数学建模赛题目录MCM85问题-A 动物群体的管理 (3)MCM85问题-B 战购物资储备的管理 (3)MCM86问题-A 水道测量数据 (4)MCM86问题-B 应急设施的位置 (4)MCM87问题-A 盐的存贮 (5)MCM87问题-B 停车场 (5)MCM88问题-A 确定毒品走私船的位置 (5)MCM88问题-B 两辆铁路平板车的装货问题 (6)MCM89问题-A 蠓的分类 (6)MCM89问题-B 飞机排队 (6)MCM90-A 药物在脑内的分布 (6)MCM90问题-B 扫雪问题 (7)MCM91问题-B 通讯网络的极小生成树 (7)MCM 91问题-A 估计水塔的水流量 (7)MCM92问题-A 空中交通控制雷达的功率问题 (7)MCM 92问题-B 应急电力修复系统的修复计划 (7)MCM93问题-A 加速餐厅剩菜堆肥的生成 (8)MCM93问题-B 倒煤台的操作方案 (8)MCM94问题-A 住宅的保温 (9)MCM 94问题-B 计算机网络的最短传输时间 (9)MCM-95问题-A 单一螺旋线 (10)MCM95题-B A1uacha Balaclava学院 (10)MCM96问题-A 噪音场中潜艇的探测 (11)MCM96问题-B 竞赛评判问题 (11)MCM97问题-A Velociraptor(疾走龙属)问题 (11)MCM97问题-B为取得富有成果的讨论怎样搭配与会成员 (12)MCM98问题-A 磁共振成像扫描仪 (12)MCM98问题-B 成绩给分的通胀 (13)MCM99问题-A 大碰撞 (13)MCM99问题-B “非法”聚会 (14)MCM2000问题-A空间交通管制 (14)MCM2000问题-B: 无线电信道分配 (14)MCM2001问题- A: 选择自行车车轮 (15)MCM2001问题-B 逃避飓风怒吼（一场恶风...） .. (15)MCM2001问题-C我们的水系-不确定的前景 (16)MCM2002问题-A风和喷水池 (16)MCM2002问题-B航空公司超员订票 (16)MCM2002问题-C (16)MCM2003问题-A: 特技演员 (18)MCM2003问题-B: Gamma刀治疗方案 (18)MCM2003问题-C航空行李的扫描对策 (19)MCM2004问题-A：指纹是独一无二的吗？ (19)MCM2004问题-B：更快的快通系统 (19)MCM2004问题-C安全与否？ (19)MCM2005问题A.水灾计划 (19)MCM2005B.Tollbooths (19)MCM2005问题C：不可再生的资源 (20)MCM2006问题A: 用于灌溉的自动洒水器的安置和移动调度 (20)MCM2006问题B: 通过机场的轮椅 (20)MCM2006问题C : 抗击艾滋病的协调 (21)MCM2007问题B ：飞机就座问题 (24)MCM2007问题C：器官移植：肾交换问题 (24)MCM2008问题A:给大陆洗个澡 (28)MCM2008问题B：建立数独拼图游戏 (28)MCM85问题-A 动物群体的管理在一个资源有限，即有限的食物、空间、水等等的环境里发现天然存在的动物群体。
试选择一种鱼类或哺乳动物(例如北美矮种马、鹿、免、鲑鱼、带条纹的欧洲鲈鱼)以及一个你能获得适当数据的环境，并形成一个对该动物群体的捕获量的最佳方针。
MCM85问题-B 战购物资储备的管理钴对许多工业是必不可少的(1979年仅国防需要就占了全世界钴生产量的17％)，但是钴不产生在美国。
大部分钴来自政治上不稳定的构F地区。
见图85B-1，85B-2，85B-3。
1946年制订的战略和稀有作战物资存贮法令要求钴的储存量应保证美国能渡过三年战争时期。
50年代政府按要求存贮了，并在70年代卖掉了大部分贮量，而在70年代后期决定重新贮存，贮存的指标是8540万磅，到1982年获得了贮量的一半。
试建立一个战略金属钴的储存管理数学模型。
你需要考虑诸如以下的问题；贮量应多大?应以多大的比率来获得贮量?买这些金属的合理价格应该是多少?还要求你考虑诸如以下的问题，贮量达到多大时应开始减少贮存量?应以多大的比率来减少？卖出这些金属的合理价格应该是多少?应该怎样分配(附页中有关于钴的资源、价格、需求及再循环等方面的信息)关于钴有用信息：1985年政府计划需要2500万磅钴。
进行周而复始的生产经营，从而每年可生产600万磅钴。
1980年占总消耗量70银的120万磅钴再循环了，得到了重新处理。
MCM86问题-A 水道测量数据表86A-1给出了在以码为单位的直角坐标为X，Y的水面一点处以英尺计的水Z．水深数据是在低潮时测得的。
船的吃水深度为5英尺。
在矩形区域(75，200)×(-50，150)里的哪些地方船要避免进入。
本题是由加州海军研究生院数学系的Richard Franke提供的，可阅他的论文Scattered Data Interpolation，Math，Comput.，38(1982)，18l-200。
MCM86问题-B 应急设施的位置“里奥兰翘镇”迄今还没有自己的应急设施。
1986年该镇得到了建立两个应急设施的安全拨款。
每个设施都把救护站、消防队和警察所合在一起。
图86B-1指出了1985年每个长方街区应急事件的次数。
在北边的上形状的区域是一个障碍，而在南边的长方形区域是一个有浅水池塘的公园。
应急车辆驶过一条南北向的街道平均要花15秒，而通过一条东西向的街道平均要花20秒。
你的任务就是确定这两个应急设施的位置，使得总的响应时间最少。
①假定需求集中在每个街道的中心而应急设施位于街角处；②假定需求是沿包围每个街区的街道上平均分布的，而应急设施可位于街道任何地方。
本题是由马里兰州沙里斯勃莱州立学院地理学与地区规划系的J.C. McGrew提供的。
MCM87问题-A 盐的存贮美国中西部一个州把冬天用来洒在马路上的盐存贮在一个球顶仓库里大约有15年了。
图87A-1表示在过去15年中盐是怎么存贮的*通过驾驶铲斗车在由盐铺成的坡道上进出仓里并利用铲斗车上的铲子把盐装进仓里或从仓里取出来。
最近，一个小组确定这种做法是不安全的。
如果铲斗车太靠近盐堆的顶端，盐就要滑动，而铲斗车就耍翻到为加固仓库而筑的拥壁上去。
小组建议，如果盐堆是用铲斗车堆起来的，那么盐堆的最高高度不要超过15英尺。
对这种情况建立一个数学模型并求得在仓库中的盐堆的最大高度。
图中仓高50英尺，拥壁高4英尺，仓的外直径103英尺，门的净空高l 9英尺9英寸，铲斗车高10英尺9英寸。
本题是由印第安纳大学的M.Thompon 提供的，是从出现在1986年11月的Indianapolis Star的一个实际问题改造而成的。
MCM87问题-B 停车场在新英格兰地区一个镇上位于街角处的一个停车场的场主雇你来设计该停车场的安排，即设计“在地上的线应怎样划法”。
你一定认识到要把尽可能多的车塞进停车场会导致以直角停靠的方式一辆挨一辆地排成行。
但是缺乏经验的司机对于这种停靠方式是有困难的，这可能引起昂贵的保险费要求。
为了减少停靠车辆时可能造成的损坏，场主就要启用一些熟练的汽车司机作为“专职停靠司机”。
另一方面，如果汽车从通道进来有一个足够大的“转弯半径”的话，那么大多数司机看来都不会有很大的困难一次就停靠到该停靠的位置上去。
当然通道愈宽能容纳的车辆就愈少，这就会导致停车场场主收入的减少。
本题是由加州海军研究生院的M．D.Weir提供的。
MCM88问题-A 确定毒品走私船的位置相距5.43哩的监听站收听到一个短暂的无线电讯号。
收听到讯早的时候测向仪分别定位在111°和119°处〔见图88A-1)，测向仪的精度为±2°，该讯号来自一个毒品交换活跃的地方，据推测该处有一只机动船正等着有人来取毒品。
当时正值黄昏、无风、无潮流。
一架小型直升飞机离开监听站①的简易机场并能精确地沿111°角方向飞行。
直升飞机的飞行速度是走私船的三倍。
在离船500英尺时船上能听到直升飞机的声音。
直升飞机只有一种侦察仪器--探照订。
在200英尺远的地方探照灯只能照明半径为25英尺的圆域。
①说明飞行员能找到正等着的毒品船的(最小)区域。
②研究一种直升飞机的最佳搜索方法。
在你的计算中要有95％的精度。
本题是由加州Claremont McKenna学院的J.A.Ferling提供的。
这是一个分类(分组问题)的修正简化形式。
原问题和现在简化的问题都还没有一种已知的最化解法。
MCM88问题-B 两辆铁路平板车的装货问题有七种规格的仪装箱要装到两辆铁路平板车上去。
包装箱的宽利高是一样的，但厚度(t，以厘米计)及重量(w，以公斤计)是不同的。
表88B-1给出了每种包装箱的厚度、重量以及数量。
图88B-1中每辆平板车有10.2米长的地方可用来装包装箱（象面包片那样)，载重为40吨。
由于当地货运的限制，对C5，C6，C7类的包装箱的总数有-个特别的限制；这类箱子所占的空间(厚度)不能超过302.7厘米。
试把包装箱装到干板车上去使得浪费的空间最小。
本题是由佐治亚理工学院的J．Bartholdi提供的。
这是出现在福特汽车公司的一个尚未解决的问题的修正与简化。
J．Bartholdi还写了一篇评论性文章The Outstanding Railroad Flatcar Papers，The UMAP Journal，v.9(1988)，no.4，399-103．MCM89问题-A 蠓的分类两种蠓Af和Apf己由生物学家W.L.Grongan和W.W.Wirth(1981年)根据它们的触角长度和翼长加以区分(见图89A-1)，9只Af蠓用标记，6只Apf鲸用“.”标记。
根据给出的触角长度和翼长识别出一只标本是Af还是Apf是重要的。
①给定一只Af或者Apf族的蝶，你如何正确地区分它属于哪一族?②将你的方法用于触角长和翼长分别为(1.24，1.80)、(1.28，1.84)、(1.40，2.04)的三个标本。
③设Af是宝贵的传粉益虫，Apf是某种疾病的载体，是否应该修改你的分类方法，若需修改，怎么改?MCM89问题-B 飞机排队机场通常都是用“先来后到”的原则来分配飞机跑道，即当飞机准备好离开登机口时，驾驶员电告地面控制中心，加入等候跑道的队伍。
假设控制塔可以从快速联机数据库中得到每架飞机的如下信息：①预定离开登机口的时间；②实际离开登机口的时间；②机上乘客人数；④预定在下一站转机的人数和转机的时间；⑤到达下一站的预定时问。
又设共有七种飞机，载客量从100人起以50人递增，载客最多的一种是400人。