Abstract: Aiming at the various practical constraints encountered in the packing process of corrugated board, a fast algorithm based on the optimal remaining space and various practical constraints is proposed. Firstly, according to the first in, last out and combination of loading constraints, the packing sequence of paperboard is determined. Then, the three-dimensional packing problem is transformed into a two-dimensional packing problem with height constraints. Based on the optimal strategy of remaining space, the space partition mode and cardboard placement mode are selected, and the remaining space is merged and repartitioned, so as to obtain the result of cardboard loading and placement and achive the goal of the highest utilization rate of container space and the minimum number of container space. Through the calculation of random and practical examples, as well as the three-dimensional visualization of the results, it is proved that the algorithm can achieve a variety of constraints, high space utilization and high operation efficiency. The effectiveness and practicability of the method are verified.

Key words: three-dimensional packing problem, remaining space, multiple target, practical constraints, corrugated board