Research on Three-Stage Packing Problem Based on Column Generation and Cut-Plan Algorithm

Combining packing and cutting problems makes it possible to study the two as a completed production logistics chain. The above problems are solved in three stages: the first stage is a two-dimensional cutting problem, and the second and third stages are packing problems. A quadratic packing strategy is proposed to decompose the packing problem into first and second packing. Finally, the three-stage model is solved by using the algorithm of column generation and cut-plane. The quadratic packing strategy can reduce the work of identifying goods in the subsequent path planning and then reduce the handling cost in each demand place. Through the test of an example, the results show that the algorithm of column generation and cutting plane are suitable for solving the proposed model and can be an effective way to solve two-dimensional cutting and packing combination problems.