A block-building constraint programming model for the container loading problem

The container loading problem involves packing a set of given rectangular boxes into a larger rectangular container of fixed size, with the objective of maximizing the volume of the loaded boxes. Most of the literature on the container loading problem and its variants proposes heuristic approaches t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & operations research Ročník 182; s. 107111
Hlavní autoři: Liu, Chang, Smith-Miles, Kate, Wauters, Tony, Costa, Alysson M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.10.2025
Témata:
Block building
Constraint programming
Container loading problem
Instance space analysis
Mathematical modeling
Packing
Block building
Mathematical modeling
Packing
Container loading problem
Instance space analysis
Constraint programming
ISSN:0305-0548
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The container loading problem involves packing a set of given rectangular boxes into a larger rectangular container of fixed size, with the objective of maximizing the volume of the loaded boxes. Most of the literature on the container loading problem and its variants proposes heuristic approaches that can find good solutions quickly. Current exact methods are mostly limited to mixed-integer programming (MIP) formulations, which often struggle to obtain good solutions for large problem instances. In this paper, we introduce two exact constraint programming models for the container loading problem. The first model uses integer and binary variables to assign boxes to valid positions and orientations within the container. The second model enhances this by incorporating the concept of block-building, commonly used in heuristic methods. Extensive computational experiments on classical benchmark instances from the literature show that the solutions obtained with the proposed models significantly outperform those achieved with existing MIP models. We also perform an instance space analysis of the proposed models to map the models’ performances across problem instances, providing deeper insights into the strengths and weaknesses of the block-building approach. •Presents two exact constraint programming models for container loading.•Block-building improves packing efficiency in the second model for most instances.•Our CP models outperform state-of-the-art MIP methods on benchmark instances.•Instance Space Analysis provides further insights into model strength and weakness.
ISSN:0305-0548
DOI:10.1016/j.cor.2025.107111