Numerical Optimization of Computer Models
Numerical Optimization of Computer Models
A Heuristic Combination Method for Solving Job-Shop Scheduling Problems
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
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
An analysis of the behavior of a class of genetic adaptive systems.
An analysis of the behavior of a class of genetic adaptive systems.
A Tabu-Search Hyperheuristic for Timetabling and Rostering
Journal of Heuristics
Case-based heuristic selection for timetabling problems
Journal of Scheduling
An experimental study on hyper-heuristics and exam timetabling
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A comprehensive analysis of hyper-heuristics
Intelligent Data Analysis
A greedy hyper-heuristic in dynamic environments
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Examination timetabling using late acceptance hyper-heuristics
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Memes, self-generation and nurse rostering
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Scheduling English football fixtures over the holiday period using hyper-heuristics
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics
IEEE Transactions on Evolutionary Computation
Hyper-heuristics with low level parameter adaptation
Evolutionary Computation
An improved choice function heuristic selection for cross domain heuristic search
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
A hyper-heuristic with a round robin neighbourhood selection
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
| Hi-index | 0.00 |
Hyperheuristics are single candidate solution based and simple to maintain mechanisms used in optimization. At each iteration, as a higher level of abstraction, a hyperheuristic chooses and applies one of the heuristics to a candidate solution. In this study, the performance contribution of hill climbing operators along with the mutational heuristics are analyzed in depth in four different hyperheuristic frameworks. Four different hill climbing operators and three mutational operators are used during the experiments. Various subsets of the heuristics are evaluated on fourteen well-known benchmark functions.