View in EDS

Mathematical models and heuristic algorithms for pallet building problems with practical constraints.

Saved in:
Bibliographic Details
Title: Mathematical models and heuristic algorithms for pallet building problems with practical constraints.
Authors: Calzavara, Gabriele1 (AUTHOR) gabriele.calzavara@unipr.it, Iori, Manuel2 (AUTHOR) manuel.iori@unimore.it, Locatelli, Marco1 (AUTHOR) marco.locatelli@unipr.it, Moreira, Mayron C. O.3 (AUTHOR) mayron.moreira@ufla.br, Silveira, Tiago1 (AUTHOR) tiago.silveira@unipr.it
Source: Annals of Operations Research. Jul2025, Vol. 350 Issue 1, p5-36. 32p.
Subject Terms: *MATHEMATICAL models, *AUTOMATION, *EMPIRICAL research, *PACKING problem (Mathematics), HEURISTIC algorithms, CONSTRAINT satisfaction, UNITIZED cargo systems
Abstract: In the pallet building problem, we aim at loading a given set of items into one or more pallets, by satisfying specific constraints and minimizing the number of pallets used. In this paper, we address a practical case of this problem that originates from a real-world robotized application, subject to some non-trivial operational constraints. In practice, items are grouped into families and must be packed into horizontal layers. To facilitate loading/unloading operations, items of the same type packed into the same layer should be contiguous and at least one of them should be visible from the outside. We present a formal mathematical description for layer and pallet creation subproblems and then we propose heuristic, metaheuristic, matheuristic algorithms to solve the overall problem. The performance of the algorithms is assessed through extensive computational tests on real-world instances. [ABSTRACT FROM AUTHOR]
Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Business Source Index
Description
Abstract:In the pallet building problem, we aim at loading a given set of items into one or more pallets, by satisfying specific constraints and minimizing the number of pallets used. In this paper, we address a practical case of this problem that originates from a real-world robotized application, subject to some non-trivial operational constraints. In practice, items are grouped into families and must be packed into horizontal layers. To facilitate loading/unloading operations, items of the same type packed into the same layer should be contiguous and at least one of them should be visible from the outside. We present a formal mathematical description for layer and pallet creation subproblems and then we propose heuristic, metaheuristic, matheuristic algorithms to solve the overall problem. The performance of the algorithms is assessed through extensive computational tests on real-world instances. [ABSTRACT FROM AUTHOR]
ISSN:02545330
DOI:10.1007/s10479-021-04349-w