摘要
为解决单循环赛的赛程编排问题,提出了基于约束编程的统一编排求解模式。同时设计与实现了perfect-matching约束用于单循环赛编排问题的约束建模。对比分析在使用和不使用perfect-matching约束对问题建模时的求解性能,实验结果表明在对大规模的复杂的单循环赛进行编排时,perfect-matching约束能够极大提高求解的效率。
Impacted by the factors of fairness, reasonableness, ornamental and tournament development, single round robin scheduling problem is difficult and complex. Constraint Programming （CP） can provide a good solution to the single round robin scheduling. Therefore, this paper proposes a CP-based CONSOLIDATED solving mode, and designs and implements a perfect-matching constraint for the modeling of the single round robin scheduling problem. The performance of using and not using perfect-matching constraint to solve the problem is compared. Experimental results show that perfect-matching constraint can greatly improve the efficiency for solving large-scaie complex single round robin scheduling.
出处
《成都工业学院学报》
2013年第1期14-17,共4页
Journal of Chengdu Technological University
基金
四川省科技支撑计划(2012GZ0090)
