A hybrid approach of simulation and metaheuristic for the polyhedra packing problem

This document presents a simulation-based method for the polyhedra packing problem (PPP). This problem refers to packing a set of irregular polyhedra (convex and concave) into a cuboid with the objective of minimizing the cuboid’s volume, considering non-overlapping and containment constraints. The PPP has applications in additive manufacturing and packing situations where volume is at a premium. The proposed approach uses Unity® as the simulation environment and considers nine intensification and two diversification movements. The intensification movements induce the items within the cuboid to form packing patterns allowing the cuboid to decrease its size with the help of gravity-like accelerations. On the other hand, the diversification movements are classic transition operators such as removal and filling of pieces and enlargement of the container, which allow searching on different solution neighborhoods. All simulated movements were hybridized with a probabilistic tabu search. The proposed methodology (with and without the hybridization) was compared by benchmarking with all previous works solving the PPP with irregular items. Results show that satisfactory solutions were reached in a short time; even a few published results were improved.