Hyper-heuristics have emerged as a way to raise the level of generality of search techniques
for computational search problems. This is in contrast to many approaches, which represent …

Hyper-heuristics are search techniques for selecting, generating, and sequencing (meta)-
heuristics to solve challenging optimization problems. They differ from traditional (meta) …

Hyper-heuristics comprise a set of approaches that aim to automate the development of
computational search methodologies. This chapter overviews previous categorisations of …

Abstract Three-Dimensional Packing Problems (3D-PPs) can be applied to effectively
reduce logistics costs in various areas, such as airline cargo management and warehouse …

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 …

An efficient manufacturing system is key to maintaining a healthy economy today. With the
rapid development of science and technology and the progress of human society, the …

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 …

We present a number of variants of a constructive algorithm able to solve a wide variety of
variants of the Two-Dimensional Irregular Bin Packing Problem (2DIBPP). The aim of the …

This paper considers the on-time guillotine cutting of small rectangular items from large
rectangular bins. Items assigned to a bin define the bins' processing time. Consequently, an …

This work presents a tailored branch‐and‐cut algorithm for the two‐dimensional irregular
strip packing problem with uncertain demand for the items to be cut. A two‐stage stochastic …