An ant algorithm hyperheuristic for the project presentation scheduling problem

Ant algorithms have generated significant research interest within the search/optimization community in recent years. Hyperheuristic research is concerned with the development of "heuristics to choose heuristics" in an attempt to raise the level of generality at which optimization systems can operate. In this paper the two are brought together. An investigation of the ant algorithm as a hyperheuristic is presented and discussed. The results are evaluated against other hyperheuristic methods, when applied to a real world scheduling problem.