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 …

Genetic programming approaches have been employed in the literature to automatically
design constructive heuristics for cutting and packing problems. These heuristics obtain …

The literature shows that one-, two-, and three-dimensional bin packing and knapsack
packing are difficult problems in operational research. Many techniques, including exact …

One-and two-dimensional packing and cutting problems occur in many commercial contexts,
and it is often important to be able to get good-quality solutions quickly. Fairly simple …

In this paper we propose and evaluate an evolutionary-based hyper-heuristic approach,
called EH-DVRP, for solving hard instances of the dynamic vehicle routing problem. A hyper …

The idea behind hyper-heuristics is to discover some combination of straightforward
heuristics to solve a wide range of problems. To be worthwhile, such a combination should …

This paper proposes an adaptation, to the two-dimensional irregular bin packing problem of
the Djang and Finch heuristic (DJD), originally designed for the one-dimensional bin …

Hyper-heuristics comprise a set of approaches with the common goal of automating the
design and tuning of heuristic methods to solve hard computational search problems. The …

Limited attention has been paid to assessing the generality performance of hyper-heuristics.
The performance of hyper-heuristics has been predominately assessed in terms of optimality …