examples are:
1. Minimize the number of the bins to pack all items.
2. Maximize the total volume of items that can be packed into one bin.
3. Find a method to pack all given items into one bin.
In real applications, certain constraints are often added to the optimization process.
For example, item orientation, spatial relationship, packing sequence, etc. These additional
constraints further complicate the process to optimize the objectives. Generally speaking, the
cargo loading problem is NP-hard. Therefore, heuristic methods are often used for its solution.