Online 2D irregular bin packing problem (2D-OIBPP) with uncertain demands is a critical challenge in the manufacturing and assembly industry, where a robot is required to place incoming objects within a limited time to maximize overall packing density. The high demands on real-time and...

Heuristics for Vector Bin Packing (VBP) play an important role in modern distributed computing systems and other applications aimed at optimizing the usage of multidimensional resources. In this paper we perform a systematic classification of heuristics for VBP. We bring together existing VBP...

Packing problems are a type of fundamental global optimization problem with many real-world applications. In this paper, we propose a new variant of three-dimensional (3D) packing problem, called the Single Cylindrical Packing Problem with Cylindrical Items (SCPP-CI), which involves packing as...