A connectionist machine for genetic hillclimbing
A connectionist machine for genetic hillclimbing
Allocating games for the NHL using integer programming
Operations Research
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Tabu Search
Scheduling a Major College Basketball Conference
Operations Research
Scheduling a Major College Basketball Conference--Revisited
Operations Research
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of CSPLib)
Discrete Applied Mathematics
Mining the data from a hyperheuristic approach using associative classification
Expert Systems with Applications: An International Journal
Using solution properties within an enumerative search to solve a sports league scheduling problem
Discrete Applied Mathematics
Clustering search approach for the traveling tournament problem
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Sports league scheduling: enumerative search for prob026 from CSPLib
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Guided restarting local search for production planning
Engineering Applications of Artificial Intelligence
Mirrored traveling tournament problem: an evolutionary approach
IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
Construction of balanced sports schedules using partitions into subleagues
Operations Research Letters
| Hi-index | 0.00 |
In this paper we present a tabu approach for a version of the Sports League Scheduling Problem. The approach adopted is based on a formulation of the problem as a Constraint Satisfaction Problem (CSP). Tests were carried out on problem instances of up to 40 teams representing 780 integer variables with 780 values per variable. Experimental results show that this approach outperforms some existing methods and is one of the most promising methods for solving problems of this type.