Saved in:
| Main Authors: | , |
|---|---|
| Format: | Recurso digital |
| Language: | |
| Published: |
Zenodo
2025
|
| Online Access: | https://doi.org/10.5281/zenodo.18011488 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- <p><strong><em><span>Abstract:</span></em></strong><em><span> The Container Loading Problem (CLP) represents one of the main challenges in the global logistics chain and aims to maximize the volumetric use of containers, reduce transportation operating costs, increase efficiency, and reduce carbon dioxide emissions. Heuristic and metaheuristic methods used to address the CLP challenge have been widely studied since the 1980s. This article review 34 studies published between 2014 and 2024, using the review by Zhao et al. (2014) as a starting point and grouping the approaches into five themes: heuristics, metaheuristics, hybrid methods, multi-objective models with real-world constraints and practical interaction in logistics environments. The review evaluates the volumetric performance of the proposed models, execution times, application maturity, and proposes to discuss its contribution into the concept of the Physical Internet (PI).</span></em></p> <p><strong><em><span>Keywords:</span></em></strong><em><span> Container Loading Problem, heuristics, metaheuristics, physical internet.</span></em></p>