A new heuristic algorithm for a class of two-dimensional bin-packing problems

Due to the diversification of customer’ demands, cutting and packing enterprises need to arrange production plans flexibly. This paper proposes a heuristic algorithm to help enterprises make cutting or packing plans. With this algorithm, a class of different customer demands are considered, such as orientation of items and cutting style. The idea of this heuristic algorithm is from the dynamic programming idea by aggregating states to avoid the explosion of the number of states. The advantages of this algorithm are its flexibility, competitive computation time, and performance with respect to metaheuristics.