An investigation on the generality level of selection hyper-heuristics under different empirical conditions

The present study concentrates on the generality of selection hyper-heuristics across various problem domains with a focus on different heuristic sets in addition to distinct experimental limits. While most hyper-heuristic research employs the term generality in describing the potential for solving various problems, the performance changes across different domains are rarely reported. Furthermore, a hyper-heuristic's performance study purely on the topic of heuristic sets is uncommon. Similarly, experimental limits are generally ignored when comparing hyper-heuristics. In order to demonstrate the effect of these generality related elements, nine heuristic sets with different improvement capabilities and sizes were generated for each of three target problem domains. These three problem domains are home care scheduling, nurse rostering and patient admission scheduling. Fourteen hyper-heuristics with varying intensification/diversification characteristics were analysed under various settings. Empirical results indicate that the performance of selection hyper-heuristics changes significantly under different experimental conditions.

[1]  Jesper Larsen,et al.  The Home Care Crew Scheduling Problem , 2008 .

[2]  María Cristina Riff,et al.  DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic , 2010, J. Heuristics.

[3]  Graham Kendall,et al.  A hyper-heuristic approach to sequencing by hybridization of DNA sequences , 2013, Ann. Oper. Res..

[4]  Alex S. Fukunaga,et al.  Automated Discovery of Local Search Heuristics for Satisfiability Testing , 2008, Evolutionary Computation.

[5]  Patrick De Causmaecker,et al.  The first international nurse rostering competition 2010 , 2010, Ann. Oper. Res..

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

[7]  Peter Ross,et al.  Generalized hyper-heuristics for solving 2D Regular and Irregular Packing Problems , 2010, Ann. Oper. Res..

[8]  E. Burke,et al.  A Late Acceptance Strategy in Hill-Climbing for Exam Timetabling Problems , 2008 .

[9]  Edmund K. Burke,et al.  A Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination Timetabling , 2010, Int. J. Appl. Metaheuristic Comput..

[10]  Juan Martín Carpio Valadez,et al.  Academic Timetabling Design Using Hyper-Heuristics , 2011, Soft Computing for Intelligent Control and Mobile Robotics.

[11]  Mazhar Ali,et al.  Hyper-Heuristic Approach For Solving Scheduling Problem: A Case Study , 2011 .

[12]  Bertrand Neveu,et al.  An Efficient Hyperheuristic for Strip-Packing Problems , 2008, Adaptive and Multilevel Metaheuristics.

[13]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[15]  Peter Demeester,et al.  One hyper-heuristic approach to two timetabling problems in health care , 2012, J. Heuristics.

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

[17]  Jin-Kao Hao,et al.  Adaptive neighborhood search for nurse rostering , 2012, Eur. J. Oper. Res..

[18]  Sara Ceschia,et al.  Multi-neighborhood Local Search for the Patient Admission Problem , 2009, Hybrid Metaheuristics.

[19]  Andrzej Bargiela,et al.  A constructive approach to examination timetabling based on adaptive decomposition and ordering , 2010, Ann. Oper. Res..

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

[21]  Riccardo Poli,et al.  Evolving timetabling heuristics using a grammar-based genetic programming hyper-heuristic framework , 2009, Memetic Comput..

[22]  Graham Kendall,et al.  A Monte Carlo Hyper-Heuristic To Optimise Component Placement Sequencing For Multi Head Placement Machine , 2003 .

[23]  María Cristina Riff,et al.  Collaboration Between Hyperheuristics to Solve Strip-Packing Problems , 2007, IFSA.

[24]  K BurkeEdmund,et al.  Integrating neural networks and logistic regression to underpin hyper-heuristic search , 2011 .

[25]  G. Dueck New optimization heuristics , 1993 .

[26]  Peter I. Cowling,et al.  Mining the data from a hyperheuristic approach using associative classification , 2008, Expert Syst. Appl..

[27]  Graham Kendall,et al.  Monte Carlo hyper-heuristics for examination timetabling , 2012, Ann. Oper. Res..

[28]  Gabriela Ochoa,et al.  On the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming , 2011, J. Oper. Res. Soc..

[29]  Peter I. Cowling,et al.  Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework , 2005, EvoCOP.

[30]  Michael Schröder,et al.  A Hybrid Approach to Solve the Periodic Home Health Care Problem , 2007, OR.

[31]  Edmund K. Burke,et al.  Examination timetabling using late acceptance hyper-heuristics , 2009, 2009 IEEE Congress on Evolutionary Computation.

[32]  Patrick De Causmaecker,et al.  A new hyper-heuristic implementation in HyFlex: a study on generality , 2011 .

[33]  Stefan Nickel,et al.  Mid-term and short-term planning support for home health care services , 2012, Eur. J. Oper. Res..

[34]  K. Verbeeck,et al.  A selection hyper-heuristic for scheduling deliveries of ready-mixed concrete , 2011 .

[35]  Patrick De Causmaecker,et al.  Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem , 2010, IEEE Congress on Evolutionary Computation.

[36]  Patrick De Causmaecker,et al.  An Intelligent Hyper-Heuristic Framework for CHeSC 2011 , 2012, LION.

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

[38]  Edmund K. Burke,et al.  Integrating neural networks and logistic regression to underpin hyper-heuristic search , 2011, Knowl. Based Syst..

[39]  Graham Kendall,et al.  A graph coloring constructive hyper-heuristic for examination timetabling problems , 2012, Applied Intelligence.

[40]  Abdellah Salhi,et al.  A Robust Meta-Hyper-Heuristic Approach to Hybrid Flow-Shop Scheduling , 2007, Evolutionary Scheduling.

[41]  Graham Kendall,et al.  A Hybrid Evolutionary Approach to the Nurse Rostering Problem , 2010, IEEE Transactions on Evolutionary Computation.

[42]  Alexander Nareyek,et al.  Choosing search heuristics by non-stationary reinforcement learning , 2004 .

[43]  Graham Kendall,et al.  A simulated annealing hyper-heuristic methodology for flexible decision support , 2012, 4OR.

[44]  Patrick De Causmaecker,et al.  A general approach for exam timetabling: a real-world and a benchmark case , 2010 .

[45]  Michel Gendreau,et al.  Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..

[46]  Sara Ceschia,et al.  Local search and lower bounds for the patient admission scheduling problem , 2011, Comput. Oper. Res..

[47]  Patrick De Causmaecker,et al.  A Hyper-heuristic Approach to the Patient Admission Scheduling Problem , 2009 .

[48]  Djamila Ouelhadj,et al.  Non-linear great deluge with reinforcement learning for university course timetabling , 2011 .

[49]  David Meignan,et al.  Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism , 2010, J. Heuristics.

[50]  A Soria-Alcaraz Jorge,et al.  Academic Timetabling Design Using Hyper-Heuristics , 2010, SOCO 2010.

[51]  Edmund K. Burke,et al.  A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems , 2010, Eur. J. Oper. Res..

[52]  Graham Kendall,et al.  A Genetic Programming Hyper-Heuristic Approach for Evolving 2-D Strip Packing Heuristics , 2010, IEEE Transactions on Evolutionary Computation.

[53]  Pascal Van Hentenryck,et al.  A simulated annealing approach to the traveling tournament problem , 2006, J. Sched..

[54]  Wolfgang Banzhaf,et al.  A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem , 2009, Eur. J. Oper. Res..

[55]  Patrick De Causmaecker,et al.  A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice , 2012, J. Sched..

[56]  Patrick De Causmaecker,et al.  A hybrid tabu search algorithm for automatically assigning patients to beds , 2010, Artif. Intell. Medicine.