The Dynamic Programming Algorithm for Solving Packing Problem of Identical Objects
The packing problem is to pack as many items as possible into a box with limited capacity.This paper studies the pack-ing problem of articles of the same size.Small boxes of the same size and specification are packed into a container to maximize the space utilization of the container,that is,the largest number of small boxes are loaded.The packing scheme is designed with the idea of layered loading and the layout of homogeneous strips.The improved dynamic programming algorithm is used to solve the layout problem of layered packing,and the backpack algorithm is used to solve the layout problem of small boxes in homogeneous strips.Compared with the existing literature algorithms,the algorithm in this paper runs faster,the packing scheme obtained is more convenient,conducive to the packing operation,and improves the packing rate in a certain program.The experimental re-sults show that the algorithm is better than the traditional dynamic programming algorithm,and can be applied to the actual container loading.
Three Dimensional ContainerDynamic ProgrammingLoading to Identical ObjectsPacking Prob-lemHierarchical LoadingKnapsack Problem
万方数据
维普
