Journal of Computational Physics
A Hyperheuristic Approach to Scheduling a Sales Summit
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
A comprehensive analysis of hyper-heuristics
Intelligent Data Analysis
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Heuristic Reinforcement Learning Applied to RoboCup Simulation Agents
RoboCup 2007: Robot Soccer World Cup XI
A method for combining complementary techniques for document image segmentation
Pattern Recognition
High performance ATP systems by combining several AI methods
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
A reinforcement learning approach to job-shop scheduling
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Examination timetabling using late acceptance hyper-heuristics
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Application of reinforcement learning for agent-based production scheduling
Engineering Applications of Artificial Intelligence
An experimental study on hyper-heuristics and exam timetabling
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Hill climbers and mutational heuristics in hyperheuristics
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
An improved choice function heuristic selection for cross domain heuristic search
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
A runtime analysis of simple hyper-heuristics: to mix or not to mix operators
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
A multi-objective hyper-heuristic based on choice function
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
One of the annual issues that has to be addressed in English football is producing a fixture schedule for the holiday periods that reduces the travel distance for the fans and players. This problem can be seen as a minimisation problem which must abide to the constraints set by the Football Association. In this study, the performance of selection hyper-heuristics is investigated as a solution methodology. Hyper-heuristics aim to automate the process of selecting and combining simpler heuristics to solve computational search problems. A selection hyper-heuristic stores a single candidate solution in memory and iteratively applies selected low level heuristics to improve it. The results show that the learning hyper-heuristics outperform some previously proposed approaches and solutions published by the Football Association.