Journal of Computational Physics
A Hyperheuristic Approach to Scheduling a Sales Summit
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
A Tabu-Search Hyperheuristic for Timetabling and Rostering
Journal of Heuristics
Case-based heuristic selection for timetabling problems
Journal of Scheduling
A simulated annealing approach to the traveling tournament problem
Journal of Scheduling
Mining the data from a hyperheuristic approach using associative classification
Expert Systems with Applications: An International Journal
Automated discovery of local search heuristics for satisfiability testing
Evolutionary Computation
Collaboration Between Hyperheuristics to Solve Strip-Packing Problems
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
Examination timetabling using late acceptance hyper-heuristics
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Multi-neighborhood Local Search for the Patient Admission Problem
HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
A hybrid tabu search algorithm for automatically assigning patients to beds
Artificial Intelligence in Medicine
A hybrid evolutionary approach to the nurse Rostering problem
IEEE Transactions on Evolutionary Computation
A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics
IEEE Transactions on Evolutionary Computation
Integrating neural networks and logistic regression to underpin hyper-heuristic search
Knowledge-Based Systems
Local search and lower bounds for the patient admission scheduling problem
Computers and Operations Research
Choosing the fittest subset of low level heuristics in a hyperheuristic framework
EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
One hyper-heuristic approach to two timetabling problems in health care
Journal of Heuristics
A graph coloring constructive hyper-heuristic for examination timetabling problems
Applied Intelligence
An intelligent hyper-heuristic framework for CHeSC 2011
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Hi-index | 0.00 |
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.