淡江大學機構典藏:Item 987654321/77457
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62819/95882 (66%)
Visitors : 3998323      Online Users : 704
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/77457


    Title: 職業運動最佳化排程暨規劃之研究 : 以美國職業棒球聯賽為例
    Other Titles: Research on optimal schedule generation of professional sports game : a case study on major league baseball
    Authors: 錢國欣;Chien, Kuo-Hsin
    Contributors: 淡江大學資訊工程學系碩士在職專班
    林其誼;Lin, Chi-yi
    Keywords: 基因演算法;運動排程;美國大聯盟;Gene Algorithm;Sport Scheduling;Major League Baseball
    Date: 2012
    Issue Date: 2012-06-21 06:46:20 (UTC+8)
    Abstract: 運動排程問題在這篇研究中被定義成路徑規劃問題，利用啟發式演算法建構有效率且符合賽制之賽程表。我們並以美國職棒大聯盟賽程表排程為例，收集相關文獻後，對此個案進行資料蒐集且深入研究，建立賽程表排程路徑規劃模式，期望所產出之賽程表能降低整個球季間球隊的總移動距離，及減低因球隊間移動距離差異過大造成賽程的公平性問題。
    本研究以美國職棒大聯盟2009年至2011年賽程表作為比較實例，包含30個球隊一年共2430場賽事的安排，總求解時間約為4.2小時。產出之賽程表比美國職棒大聯盟近三年球季的平均總移動距離減少了約14.7萬公里，當中有23支球隊降低了每年的移動距離。此外，我們成功地降低移動距離最長與最短的球隊之間的差距達36%，減少了移動距離差異過大之不公平的問題，我們期望此系統可作為美國職棒大聯盟賽程安排之決策支援系統，將來亦可擴展應用範圍至世界各國職業運動賽程排程規劃與決策。
    The scope of this study is on planning an optimal schedule for professional sports game. We take the MLB as an example to construct an effective schedule by a heuristic algorithm which meets the league rules. After collecting the references, we proceed to gather the information and to research it deeply for this case. We design the pattern for planning the schedules, and organize the related statistic reports about the scheduling. Finally, we estimate the results and analyze the targets. We expect to reduce the total moving distance of the MLB and make the schedule of the MLB fairer.
    This research applies the contests scheduling of year 2009 to 2011 of the MLB as a case study. It takes 4.2 hours to get the solution. The output of our system is shorter than the average moving distance of the MLB in recent 3 years by 147,000 km, and 23 out of the 30 teams can reduce their moving distances in the season. Moreover, the ratio between the two teams with the longest moving distance to the shortest moving distance is reduced by 36 %. That is, our approach makes the schedule fairer. We expect that this research can be used to establish the schedule decision support system for the MLB, and for other professional sports games around the world.
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Thesis

    Files in This Item:

    File SizeFormat
    index.html0KbHTML239View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback