Can machine learning help in solving the pallet loading optimization problem?

Abstract The Distributor’s Pallet Loading Problem aims to optimize the loading of different 3D boxes on the minimum number of pallets. We consider an Integer Linear Programming (ILP) model for the problem that includes constraints deriving from real applications, such as stability and compression limits. In order to solve the ILP problem efficiently, we propose a method that exploits Machine Learning algorithms to classify predetermined layers of boxes, based on their “importance” of being used for an ILP solution. This classification is used to heuristically limit the number of layers taken into account by the ILP solver. We demonstrate the effectiveness of our approach by comparing the ILP solution with and without the Machine Learning component. The numerical results show that the proposed Machine Learning matheuristic approach achieves optimized pallet loading solutions in significantly reduced computational time.

Authors

Institutions

Publication Details

Journal
Journal of Heuristics
Published
2026-02-24
DOI
https://doi.org/10.1007/s10732-026-09586-5
Primary Topic
Optimization and Packing Problems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Can machine learning help in solving the pallet loading optimization problem?

Giorgia Franchini, Matteo Magnani, Mauro Dell’Amico, Luca Zanni
Journal of Heuristics
Optimization and Packing Problems
article

Can machine learning help in solving the pallet loading optimization problem?

Giorgia Franchini, Matteo Magnani, Mauro Dell’Amico, Luca Zanni
article en

Abstract

Abstract The Distributor’s Pallet Loading Problem aims to optimize the loading of different 3D boxes on the minimum number of pallets. We consider an Integer Linear Programming (ILP) model for the problem that includes constraints deriving from real applications, such as stability and compression limits. In order to solve the ILP problem efficiently, we propose a method that exploits Machine Learning algorithms to classify predetermined layers of boxes, based on their “importance” of being used for an ILP solution. This classification is used to heuristically limit the number of layers taken into account by the ILP solver. We demonstrate the effectiveness of our approach by comparing the ILP solution with and without the Machine Learning component. The numerical results show that the proposed Machine Learning matheuristic approach achieves optimized pallet loading solutions in significantly reduced computational time.

Journal of HeuristicsVol. 32(1)
University of Modena and Reggio Emilia (IT), Institute of Informatics and Telematics (IT), National Research Council (IT)
Istituto Nazionale di Alta Matematica "Francesco Severi", European Commission, Gruppo Nazionale per il Calcolo Scientifico
Openalex Percentile: Top 48%
Optimization and Packing Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.