A three-dimensional container loading algorithm for solving logistics packing problem

In addressing the challenge of large-scale packing of strongly heterogeneous cargo in logistics loading, this paper proposes a three-dimensional container loading algorithm that integrates a block-building heuristic, an optimized placement strategy, and an enhanced genetic algorithm. The proposed approach accounts for six practical constraints inherent in logistics packaging and establishes an optimization model aimed at maximizing container space utilization while adhering to permissible center of gravity deviations. First, a block construction heuristic is employed to preprocess the cargo by aggregating items into larger blocks, thereby significantly reducing problem size and computational complexity. Subsequently, an improved placement strategy, combined with a genetic algorithm, is applied to identify an initial feasible packing layout. Finally, a simulated annealing operator is introduced to further refine the solution through local optimization, thereby obtaining an enhanced loading solutions with improved loading efficiency. Through comparative experiments with other leading algorithms using public datasets, the results demonstrate that the proposed algorithm performs on par with existing methods in solving the three-dimensional packing problem for strongly heterogeneous items while satisfying multiple constraints. It is capable of providing high-quality loading solutions for logistics enterprises and offers valuable insights for addressing more realistic container loading problems in future research. • The block generating heuristic algorithm is combined with the optimized placement point strategy to handle strongly heterogeneous types of goods. • The strategy for placeable points has been optimized, incorporating strategies such as moving usable points down, position scoring, and prioritizing corner points. • The genetic algorithm is improved, and local simulated annealing is combined to strengthen the algorithm's ability to find the optimal solution. • The algorithm can effectively solve the problem of multi-size cargo packing. • The algorithm takes into account a variety of real-world constraints.