詼諧的語言，生動的內(nèi)容一分鐘快速掌握科技最新動態(tài)

>>>本期節(jié)目音頻下載<<<

Researchers Tell Umpires Where To Go


The traveling salesman problem is a favorite math conundrum: if a salesman has to visit a bunch of cities, how do you get him to all of them once via the shortest possible route. But the traveling salesman’s predicament pales in comparison to figuring out the best ways to get four-man crews of umpires to every major league baseball game. A research team attacked the problem for the last few years. Their solution appears in Interfaces. It’s a journal of Operations Research.
那些跑銷售的人有一個苦惱的數(shù)學題：如果一個推銷員需要拜訪數(shù)個城市，那么他怎樣才能一次完成任務并且采用最短的路線。但當找尋合適的方法為棒球職業(yè)聯(lián)賽中的四名裁判員成完成裁判任務擺在推銷人員的困境面前時，他們的無奈蒼白了許多。一個研究小組已經(jīng)研究了這個問題幾年。他們的研究結(jié)果發(fā)表在《界面》（一本機械研究雜志）上

In addition to minimizing travel, here are some 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 more than 21 days in a row. They should not ump any one team’s games for more than four series all year. There are plenty more.
此外，為了減少行程，對裁判有很多限制。他們需要在至少到一次職棒聯(lián)盟城市，需要在吹當?shù)鼗蛘呗愤^城市中的比賽，并且他們在一個巡回中不能工作超過21天，不能在一年中吹同一個隊伍的比賽四季。當然還有更多的規(guī)矩。

The researchers first had to develop the question, dubbed the Traveling Umpire Problem. They used brute-force computation and heuristics for their solutions. The result was good enough for Major League Baseball to adopt the last three seasons. Previously, a former umpire made the schedule. That guy is out.
研究者們首先要列出裁判們行程中的問題。他們利用抗窮舉性計算和啟發(fā)式數(shù)學法來設(shè)計路線。這些結(jié)果已經(jīng)被職業(yè)棒球聯(lián)盟采納三個賽季。從前都是裁判自己定行程，這種方式已經(jīng)過時。

點擊進入?yún)⑴c科學60秒查看背景資料和單詞總結(jié)>>>


聲明：音視頻均來自互聯(lián)網(wǎng)鏈接，僅供學習使用。本網(wǎng)站自身不存儲、控制、修改被鏈接的內(nèi)容。"滬江英語"高度重視知識產(chǎn)權(quán)保護。當如發(fā)現(xiàn)本網(wǎng)站發(fā)布的信息包含有侵犯其著作權(quán)的鏈接內(nèi)容時，請聯(lián)系我們，我們將依法采取措施移除相關(guān)內(nèi)容或屏蔽相關(guān)鏈接。