We review the most important mathematical models and algorithms developed for the exact
solution of the one-dimensional bin packing and cutting stock problems, and experimentally …

Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the
goal of automating the design of heuristic methods to solve hard computational search …

Hyper-heuristics is a fairly recent technique that aims at effectively solving various real-world
optimization problems. This is the first book on hyper-heuristics, and aims to bring together …

This paper presents an investigation of a simple generic hyper-heuristic approach upon a
set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Within …

Hyper-heuristics represent a novel search methodology that is motivated by the goal of
automating the process of selecting or combining simpler heuristics in order to solve hard …

Discovering the conditions under which an optimization algorithm or search heuristic will
succeed or fail is critical for understanding the strengths and weaknesses of different …

The term “hyper-heuristics” is fairly new, although the notion has been hinted at in papers
from time to time since the 1960s (eg Crowston et al., 1963). The key idea is to devise new …

Given their economic importance, there is continuing research interest in providing better
and better solutions to real-world scheduling problems. The models for such problems are …

Hyper-heuristics aim at interchanging different solvers while solving a problem. The idea is
to determine the best approach for solving a problem at its current state. This way, every time …

Hyper-heuristics can be identified as methodologies that search the space generated by a
finite set of low level heuristics for solving search problems. An iterative hyper-heuristic …