An ant algorithm hyperheuristic for the project presentation scheduling problem

Abstract- Ant algorithms have generated significant research interest within the search/optimisation 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 optimisation 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.

• Type: Conference
• Year: 2005
• Where: CEC
• Authors: Edmund K. Burke, Graham Kendall, Dario Landa Silva, Ross O'Brien, Eric Soubeiga
• Keywords: Ant Algorithm, Artificial Intelligence, CEC 2005, Search/optimisation Community, World Scheduling Problem