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 …

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 …

Distributors are faced with loading constraints in their route planning, eg, multi-dimensional
packing constraints, unloading sequence constraints, stability constraints and axle weight …

Warehouses are an inevitable component in any supply chain and a vividly investigated
object of research. Much attention, however, is absorbed by warehousing systems dedicated …

Problems of loading, unloading and premarshalling of stacks as well as combinations
thereof appear in several practical applications, eg container terminals, container ship …

The three-dimensional bin packing problem (3D-BPP) plays a critical role in logistics
activities. Prior studies focus on 3D-BPP in cases where bin size is predetermined. However …

Three‐dimensional cutting and packing problems have a range of important applications
and are of particular relevance to the transportation of cargo in the form of container loading …

Online 3D Bin Packing Problem (3D-BPP) has a wide range of industrial applications and
there is an emerging research interest in learning optimal bin packing policy and deploying …

Abstract The Split Delivery Vehicle Routing Problem with three-dimensional loading
constraints (3L-SDVRP) combines vehicle routing and three-dimensional loading with …

At present, the food and food packaging industry is increasingly confronted with and gently
forced by consumers and governmental organizations to resolve issues related to food …