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.

[1]  Graham Kendall,et al.  A Tabu-Search Hyperheuristic for Timetabling and Rostering , 2003, J. Heuristics.

[2]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[3]  Eric Soubeiga,et al.  Development and application of hyperheuristics to personnel scheduling , 2003 .

[4]  Alain Hertz,et al.  Ants can colour graphs , 1997 .

[5]  Sanja Petrovic,et al.  Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems , 2002 .

[6]  Peter Ross,et al.  Hyper-heuristics: Learning To Combine Simple Heuristics In Bin-packing Problems , 2002, GECCO.

[7]  Graham Kendall,et al.  An adaptive Length chromosome Hyper-Heuristic Genetic Algorithm for a Trainer Scheduling Problem , 2002, SEAL.

[8]  Michael Sampels,et al.  A MAX-MIN Ant System for the University Course Timetabling Problem , 2002, Ant Algorithms.

[9]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[10]  Sanja Petrovic,et al.  A graph-based hyper-heuristic for educational timetabling problems , 2007, Eur. J. Oper. Res..

[11]  Graham Kendall,et al.  A Hyperheuristic Approach to Scheduling a Sales Summit , 2000, PATAT.

[12]  E. Burke,et al.  Hybrid Graph Heuristics within a Hyper-Heuristic Approach to Exam Timetabling Problems , 2005 .

[13]  Graham Kendall,et al.  Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem , 1999, Australian Joint Conference on Artificial Intelligence.

[14]  Raymond S. K. Kwan,et al.  Distributed Choice Function Hyper-heuristics for Timetabling and Scheduling , 2004, PATAT.

[15]  Peter Ross,et al.  Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heuristics , 2003, GECCO.

[16]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[17]  Graham Kendall,et al.  Guided Operators for a Hyper-Heuristic Genetic Algorithm , 2003, Australian Conference on Artificial Intelligence.

[18]  E. Soubeiga,et al.  Multi-Objective Hyper-Heuristic Approaches for Space Allocation and Timetabling , 2005 .

[19]  Sanja Petrovic,et al.  Case-based heuristic selection for timetabling problems , 2006, J. Sched..

[20]  H. Terashima-Marín,et al.  Evolution of Constraint Satisfaction strategies in examination timetabling , 1999 .

[21]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[22]  F. Comellas,et al.  An Ant Algorithm for the Graph Colouring Problem , 1998 .

[23]  Graham Kendall,et al.  Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.

[24]  R. Steele.  Optimization , 2005 .

[25]  Graham Kendall,et al.  Hyperheuristics: A Tool for Rapid Prototyping in Scheduling and Optimisation , 2002, EvoWorkshops.

[26]  Graham Kendall,et al.  An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).