After the seminal books by Martello and Toth (1990) and Kellerer, Pferschy, and Pisinger
(2004), knapsack problems became a classical and rich research area in combinatorial …

The three-dimensional packing problem (3D-PP) is a classic NP-hard problem in operations
research and computer science. One of the most popular ways to solve the problem is …

Efficient packing of items into bins is a common daily task. Known as Bin Packing Problem, it
has been intensively studied in the field of artificial intelligence, thanks to the wide interest …

Recently, there is a growing attention on applying deep reinforcement learning (DRL) to
solve the 3-D bin packing problem (3-D BPP). However, due to the relatively less informative …

This paper addresses the Single Container Loading Problem. We present an exact
approach that considers the resolution of integer linear programming and constraint …

With the development of intelligent logistics technology, some companies began to use
robots instead of humans to load cargo. This paper studies a novel container loading …

We consider a real-world packing problem faced by a logistics company that loads and
ships hundreds of trucks every day. For each shipment, the cargo has to be selected from a …

Cutting and packing problems are hard combinatorial optimization problems that arise in
several manufacturing and process industries or in their supply chains. The solution of these …

This study focuses on an airfreight forwarder's shipment planning problem, while
considering shipment consolidation and containerization in the international supply chain …

This paper presents a Large Neighbourhood Search (LNS) algorithm that finds an effective
packing of a set of items into containers. The aim of the LNS algorithm is to provide packing …