| 赛程安排的优化设计 |
| |
| 引用本文： | 容贞良,文小勇,郭一新.赛程安排的优化设计[J].邵阳学院学报(社会科学版),2003,2(2):25-29. |
| |
| 作者姓名： | 容贞良 文小勇 郭一新 |
| |
| 作者单位： | 邵阳学院计算机系,湖南,邵阳,422000 |
| |
| 摘 要： | 假设多支球队在同一场地进行单循环赛，根据公平合理的原则，使各队每两场相邻比赛中间得到尽量多的较为均等休整时间，建立了轮特法模型及其扩充来安排赛程．首先对于5支球队的比赛，给出了一个各队每两场比赛中间都至少相隔一场的赛程，然后证明了当n支球队比赛时，各队每两场比赛中间相隔的场次数的上限是(n—3)/2]，在达到以上上限的条件下，利用轮特模型及其扩充编制了n＝8和n＝9的赛程，并编程实现．最后给出了衡量一个赛程优劣的其它指标，如总间隔数、平均间隔数、间隔数方差等，同时说明了以上所给赛程达到这些指标的程度．
|
| 关 键 词： | 赛程安排 优化设计 单循环赛 公平 轮转法 上限 场次数 总间隔数 平均间隔数 间隔数方差 |
| 文章编号： | 1672-1012(2003)02-0025-05 |
| 修稿时间： | 2003年2月19日 |
Optimization Design for the Schedule Arrangement |
| |
| RONG Zhen-liang,WEN Xiao-yong,GUO Yi-xin Counselor: XIE Bing.Optimization Design for the Schedule Arrangement[J].Journal of Shaoyang University:Social Science,2003,2(2):25-29. |
| |
| Authors: | RONG Zhen-liang WEN Xiao-yong GUO Yi-xin Counselor: XIE Bing |
| |
| Abstract: | In this paper it is supposed that many teams carry on one-cycle match in the same place and every team tries their best to get more equal time for rest and reorganization in the middle of every two adjoining matches according to fair principle. We arrange the schedule by round model and its expansion. To the first 5 teams, we give the schedule that, for each team, every two matches is separated by one match at least. Then we prove that to n teams, the upper limit of number every team separated in the middle of every two matches is . When reaching the above terms of upper limit, we work out schedules to n =8 and n =9 by the round model and its expansion and then program it. Finally, we judge schedules according to some other indexes as total interval, average interval, and the interval counts variance, etc. At the same time it shows the degree of index which these schedules have reached. |
| |
| Keywords: | one-cycle match try one's best to be fair round model and its expansion upper limit |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
