作业帮 > 英语 > 作业

英语翻译The traveling salesman problem is afavorite math conundr

来源:学生作业帮 编辑:拍题作业网作业帮 分类:英语作业 时间:2024/05/06 02:56:06
英语翻译
The traveling salesman problem is afavorite math conundrum:if a salesman has to visit a bunch of cities,how doyou get him to all of them once via the shortest possible route.But thetraveling salesman's predicament pales in comparison to figuring out the bestways to get four-man crews of umpires to every major league baseball game.Aresearch team attacked the problem for the last few years.Their solutionappears in Interfaces.It's a journal of operations research.
In addition to minimizing travel,here aresome of the umpire constraints.Crews should visit each MLB city at least once.They should work each team at home and on the road.They should not work morethan 21 days in a row.They should not ump any one team’s games for more thanfour series all year.There are plenty more.
The researchers first had to develop thequestion,dubbed the "traveling umpire problem." They usedbrute-force computation and heuristics for their solutions.The result was goodenough for Major League Baseball to adopt the last three seasons.Previously,aformer umpire made the schedule.That guy is out.
“旅行商问题”是一个令人着迷的数学谜题:
如果一个推销员必须要到访一系列城市,你如何能让他以最短的合理行程到访每个城市?相比“如何安排出四位裁判组到达美国职业棒球大联盟每场比赛地的最佳路线?”这一难题来说,“旅行商路线”问题要略为逊色了.过去几年中,有个研究小组一直在对这个难题进行攻关.他们的破解文章发表在《Interfaces》这一“运筹学”期刊上.
除了上述行程最短化之外,这里还有一些对裁判的约束条件:
-\x05裁判小组应到访每个美国职棒大联盟(MLB)比赛地至少一次
-\x05需在家或者在路上为每个棒球队工作
-\x05每轮比赛的工作时间不得超过21天
-\x05在一年里不得为任一球队裁判超过4场比赛
诸如此类的限制有很多
研究人员首先要对这一被称作“旅游裁判员问题”进行深度开发.他们采用“暴力破解法”以及“启发法”求解.研究结果对职棒大联盟而言已经是足够好了,所以在过去的三个赛季里该结果均被美国职棒大联盟所采用.之前,用的是某个前裁判所做的方案.现在被淘汰了.