We survey the main formulations and solution methods for two-dimensional orthogonal
cutting and packing problems, where both items and bins are rectangles. We focus on exact …

Several different ways exist for approaching hard optimization problems. Mathematical
programming techniques, including (integer) linear programming based methods, and …

Digital twins can achieve hardware-in-the-loop simulation of both physical equipment and
cyber model, which could be used to avoid the considerable cost of manufacturing system …

Given a set of demand and potential facility locations and a set of fully available charged
drones, an agency seeks to locate a pre-specified number of capacitated facilities and …

The current state of the art in hyper-heuristic research comprises a set of approaches that
share the common goal of automating the design and adaptation of heuristic methods to …

In this survey we discuss different state-of-the-art approaches of combining exact algorithms
and metaheuristics to solve combinatorial optimization problems. Some of these hybrids …

Manifold possibilities of hybridizing individual metaheuristics with each other and/or with
algorithms from other fields exist. A large number of publications documents the benefits and …

This book provides a comprehensive overview of the most important and frequently
considered optimization problems concerning cutting and packing. Based on appropriate …

This book explains the most prominent and some promising new, general techniques that
combine metaheuristics with other optimization methods. A first introductory chapter reviews …

This paper studies a variant of the three-dimensional bin packing problem (3D-BPP), where
the bin height can be adjusted to the cartons it packs. The bins and cartons to be packed are …