A sports tournament scheduling problem: Exploiting constraint-based algorithm and neighborhood search for the solution
The problem of sports tournament scheduling at a university sports event was the case being studied due to the inefficiency of previous schedules and the dissatisfaction from the sports players. Supports from the literature have provided strong ground for the exploitation of constraint-based progr...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | Conference or Workshop Item |
| 言語: | English |
| 出版事項: |
2012
|
| 主題: | |
| オンライン･アクセス: | http://repo.uum.edu.my/16880/1/5.pdf http://repo.uum.edu.my/16880/ http://www.iaeng.org/publication/WCE2012/WCE2012_pp95-99.pdf |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
| 要約: | The problem of sports tournament scheduling at a
university sports event was the case being studied due to the inefficiency of previous schedules and the dissatisfaction from the sports players. Supports from the literature have provided strong ground for the exploitation of constraint-based
programming and neighborhood search as the approach to solve the problem.In constructing the improved tournament schedules, various criteria, regulations and policies need to be taken into consideration. The result from this promising approach is able to assist the coach or the sports events management through efficient schedules and thus, minimizing the dissatisfaction. |
|---|