This paper addresses the container loading problem with multiple constraints that occur at
many manufacturing sites, such as furniture factories, appliances factories, and kitchenware …

Optimizing the order-fulfillment process is crucial to the logistics industry. Replacing
experience-based judgment with intelligent methods in the packing process not only …

This paper presents a binary tree search algorithm for the three dimensional container
loading problem (3D-CLP). The 3D-CLP is about how to load a subset of a given set of …

This paper presents an efficient heuristic block-loading algorithm based on multi-layer
search for the three-dimensional container loading problem. First, a basic heuristic block …

This paper presents a multiple-level tree search algorithm for the three dimensional
container loading problem. This algorithm generates a loading plan in the box-piece-strip …

3D container loading problem (3D-CLP) is a classic NP-hard optimization problem. Although
computer scientists and discrete mathematicians have studied this problem for decades …

In the logistics industry, the integration of the vehicle routing problem and the container
loading problem which has been generalised as pickup and delivery problem with three …

Based on the heuristic packing algorithm, this paper proposes a 3D packing algorithm that
can run efficiently to improve the efficiency of palletizing and packing. The design of the …

The three-dimensional bin packing problem (3D-BPP) is a classic NP-hard combinatorial
optimization problem, which is difficult to be solved with an exact solution, so lots of heuristic …

A hybrid strategy heuristic algorithm (HSHA) is proposed to solve the three-dimensional
layout optimization problem of strongly heterogeneous container loading. Firstly …