運動競賽賽制之分析

Analysis of Tournament Scheduling

許子奕(Tzu-Yi Hsu)

指導教授 ： 蘇玲慧

中原大學/電機資訊學院/工業與系統工程研究所/碩士(2011年)

https://doi.org/10.6840/cycu201100722

摘要

本研究針對三種兩階段的混合賽制排程問題分別討論，探討三種賽制之階層、比賽數量以及最小所需時段，並提出演算法，目標為滿足時間限制讓場地數量最小化，最後將羣論與限制規劃應用在循環賽排程，進行模擬實驗，以提供學術界與體育界解決運動排程問題與賽制的理論階層。

關鍵字

限制規劃 ； 羣論 ； 混合賽制 ； 運動排程

並列摘要

In this paper we consider three general multi-stage tournaments sports scheduling problems and propose solution algorithms for it. The objective is to identify a feasible schedule with minimal venues subject to time period constraint. We demonstrate how the group round robin tournaments in the preliminary contest followed by single elimination, double elimination and round robin tournaments at the finals can be scheduled through mathematical optimization including group theory and constraint satisfaction programming.

並列關鍵字

group theory ； multi-stage tournaments ； constraint satisfaction programming ； sports scheduling

參考文獻

[1] de Werra D., Minimizing irregularities in sports schedules using graph theory. Discrete Applied Mathematics 1982; 4(3):217-26

[3] A. Trick, A Schedule-Then-Break Approach to Sports Timetabling. E. Burke and W. Erben (Eds.): PATAT 2000, LNCS 2079, pp. 242–253, 2001.

[4] D. Briskorn and A. Drexl, A branching scheme for finding cost-minimal round robin tournaments. European Journal of Operational Research 197 (2009) 68–76

[5] T.H. Yang, R.T. Wang and C.H. Tseng, The Application of goal programming to the scheduling problem of the professional baseball league. Journal of the Chinese Institute of Industrial Engineers, Vol. 26, No. 2, pp. 135-146 (2009)

[6] S. Knust, D.Lücking, Minimizing costs in round robin tournaments with place constraints. Computers & Operations Research 36 (2009) 2937 -- 2943