Exact Method for the Container Loading Problem with Priority and Stability

In this work, it is presented an exact method to solve the Single Container Loading Problem, which aims at deciding which items should be packed into the container in order to attain the maximum loaded value. The method is derived from the resolution of integer and constraint programming models. One of the integer programming models is a relaxation for the three-dimensional packing problem related to arranging items into the container. Besides that, it is measured how constraints related to priority conditions and vertical and horizontal load cargo stability can impact on the solution. Instances from the literature are solved in order to assess the method behavior in relation to the occupied volume and runtime. It has been observed that the highest volume losses have happened when the priority conditions are taken into consideration, while the runtime has increased when the vertical and horizontal stability constraints are considered.