The basic Container Loading Problem can be defined as the problem of placing a set of boxes into the container respecting the geometric constraints and physical world constraints.

# The Problem

The main problem can be either 1D, 2D, 3D or higher-dimensional. But here we will focus on the 3D containers and 3D Pallets.

• Homogeneous: All boxes are of the same size
• Weakly Heterogeneous: Many identical boxes of the same dimension and some different boxes of a different dimension
• Strongly Heterogeneous: All boxes are of different sizes

• Manufacture’s PLP: Occurs when there are homogeneous boxes to be efficiently placed onto the pallet
• Distributer’s PLP: Occurs when it is necessary to stack heterogeneous boxes onto the pallet

Now we breakdown CLP and PLP into multiple type as per their Input minimization and Output maximization.

## Input (value) minimization problem types are the following :

• Single Stock-Size Cutting Stock Problem (SSSCSP)
Packing a weakly heterogeneous set of cargo into a minimum number of identical containers.
• Multiple Stock-Size Cutting Stock Problem (MSSCSP)
Packing a weakly heterogeneous set of cargo into a weakly heterogeneous assortment of containers such that the value of the used containers is minimized.
• Residual Cutting Stock Problem (RCSP)
Packing a weakly heterogeneous set of cargo into a strongly heterogeneous assortment of containers such that the value of the used containers is minimized.
• Single Bin-Size Bin Packing Problem (SBSBPP)
Packing a strongly heterogeneous set of cargo into a minimum number of identical containers.
• Multiple Bin-Size Bin Packing Problem (MBSBPP)
Packing a strongly heterogeneous set of cargo into a weakly heterogeneous assortment of containers such that the value of the used containers is minimized.
• Residual Bin Packing Problem (RBPP)
Packing a strongly heterogeneous set of cargo into a strongly heterogeneous assortment of containers such that the value of the used containers is minimized.
• Open Dimension Problem (ODP)
Packing a set of cargo into a single container with one or more variable dimensions such that the container volume is minimized.
- Weakly Heterogeneous assortment of cargo (ODP/W)
- Strongly Heterogeneous assortment of cargo (ODP/S)

## Output (value) maximization problem types can be distinguished:

It is equivalent to the maximization of the container volume utilization if the value of the small items is proportional to their volume.

• Identical Item Packing Problem (IIPP)
Loading a single container with a maximum number of identical small items.
• Single Large Object Placement Problem (SLOPP)
Loading a single container with a selection from a weakly heterogeneous set of cargo such that the value of the loaded items is maximized.
• Multiple Identical Large Object Placement Problem (MILOPP)
Loading a set of identical containers with a selection from a weakly heterogeneous set of cargo such that the value of the loaded items is maximized.
• Multiple Heterogeneous Large Object Placement Problem (MHLOPP)
Loading a (weakly or strongly) heterogeneous set of containers with a selection from a weakly heterogeneous set of cargo such that the value of the loaded items is maximized.
• Single Knapsack Problem (SKP)
Loading a single container with a selection from a strongly heterogeneous set of cargo such that the value of the loaded items is maximized.
• Multiple Identical Knapsack Problem (MIKP)
Loading a set of identical containers with a selection from a strongly heterogeneous set of cargo such that the value of the loaded items is maximized.
• Multiple Heterogeneous Knapsack Problem (MHKP)
Loading a set of (weakly or strongly) heterogeneous containers with a selection from a strongly heterogeneous set of cargo such that the value of the loaded items is maximized.

Next we will talk about some of the common and uncommon Constraints for the problem.

# The Constraints

## Basic Constraints:

These constraints are common to all type of optimization problem regarding 3D Container Optimization.

1. Boxes may only be placed with their edges parallel to the walls of the container
2. All boxes must be placed within the container
3. Boxes may not intersect each other

Apart from these basic constraints, there is a multitude of practical considerations as well which are considered as well.

Container- related constraints

• Weight limits
• Weight distribution constraints

Item-related constraints

• Orientation constraints
i. Case 1
Only a single orientation is permitted for each box (type) in both vertical and horizontal direction, i.e. the boxes cannot be rotated
ii. Case 2
Only a single vertical orientation is permitted for each box (type) while no restriction is given with respect to their horizontal direction
iii. Case 3
There is no general restriction with respect to the orientation of the boxes in a vertical direction. However, up to two vertical orientations may be prohibited for each box (type). In the horizontal direction, the orientation is free, but – due to the limitation to orthogonal patterns – boxes can be rotated in steps of 90 degree
iv. Case 4
There is no general restriction with respect to the orientation of the boxes in both vertical and horizontal direction. However, up to five orientations may be prohibited for each box (type). This case includes the largest variety of different orientation constraints
v. Case 5
There exists no constraint with respect to the orientation of the boxes, neither in vertical nor in the horizontal orientation. All boxes are free rotatable
• Stacking constraints -Non-fragile boxes can only be placed on other non-fragile ones, but not on fragile ones, while fragile boxes can be put on non-fragile and other fragile ones
• Cargo-related constraints
i.  Complete-shipment constraints
ii. Allocation constraints
• Positioning constraints