Authors:
Manuel Iori
1
;
Marco Locatelli
2
;
Mayron C. O. Moreira
3
and
Tiago Silveira
2
Affiliations:
1
Department of Engineering and Architecture, University of Modena and Reggio Emilia, Reggio Emilia, Italy
;
2
Department of Engineering and Architecture, University of Parma, Parma, Italy
;
3
Department of Computer Science, Federal University of Lavras, Lavras, Brazil
Keyword(s):
3D Packing, Practical Constraints, Contiguity, Visibility, Constructive Heuristics, Real-world Instances.
Abstract:
We study a pallet building problem that originates from a case study at a company that produces pallet building robotized systems. The problem takes into account well known constraints, such as rotation and stackability, and we introduce two practical constraints named visibility and contiguity between items of the same type. We formalize the problem and propose heuristic algorithms to solve it, using a strategy that first creates 2D layers and, then, creates the final 3D pallets. The proposed heuristic is based mainly on the Extreme Points heuristic, that is tailored to choose feasible positions to pack items during the construction of the solution. Besides that, we adapt our proposed heuristic using other basic heuristics from the literature, considering different constraints. The performance of the algorithms is assessed through extensive computational tests on real-world instances, and the obtained results show the proposed heuristics are able to create compact packing in a very
short time.
(More)