Answers are grounded in this paper and cite their sources.
The Container Loading Problem (CLP) concerns the arrangement of rectangular boxes inside a container while satisfying practical requirements such as dimensional feasibility, weight capacity, stackability, delivery order, and cargo stability. In multi-drop delivery settings, additional operational challenges arise, including reducing unloading obstacles (ULOs) and maintaining load balance. This paper formulates a tri-objective CLP that simultaneously (i) maximizes space utilization, (ii) minimizes ULOs, and (iii) minimizes the loaded cargo’s center-of-gravity (CG) deviation from the container’s geometric center across all three spatial axes. The formulation integrates these operational and stability considerations within a unified mathematical framework. To address the resulting problem, a customized Non-dominated Sorting Genetic Algorithm II (NSGA-II) is combined with an extreme-point placement decoder based on the deepest-bottom-left-fill strategy and balance-aware placement considerations. The framework also incorporates geometric feasibility, orientation restrictions, vertical support, stackability, payload limits, and delivery priorities. Computational experiments on modified Bischoff and Ratcliff benchmark instances show how volume utilization, unloading accessibility, and CG balance interact under different levels of instance heterogeneity and cargo-weight distributions. The resulting nondominated solution sets expose alternative compromises among packing efficiency, delivery accessibility, and load balance, providing a multi-objective evaluation framework for operational container loading.
No takes yet. Share an insight, caveat, or question.
Elahi et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: