Ant algorithm hyperheuristic approaches for scheduling problems
O'Brien, Ross (2008) Ant algorithm hyperheuristic approaches for scheduling problems. MPhil thesis, University of Nottingham.
For decades, optimisation research has investigated methods to find optimal solutions to many problems in the fields of scheduling, timetabling and rostering. A family of abstract methods known as metaheuristics have been developed and applied to many of these problems, but their application to specific problems requires problem-specific coding and parameter adjusting to produce the best results for that problem. Such specialisation makes code difficult to adapt to new problem instances or new problems. One methodology that intended to increase the generality of state of the art algorithms is known as hyperheuristics.
Repository Staff Only: item control page