Solving Rectangle Packing Problem Based on Heuristic Dynamic Decomposition Algorithm

Abstract

This paper proposes a heuristic dynamic decomposition algorithm for solving twodimensional rectangular layout and global optimization problems. First, the container was orthogonally decomposed according to the emission rectangle, and the layout was carried out based on a heuristic placement strategy with a high hit rate, so the large-scale and complex problem can be solved quickly and efficiently. The results of several internationally recognized studies show that this algorithm has a distinct advantage in terms of computing time and calculation accuracy. In addition, the algorithm can be effectively extended to the global layout of multi-vessel and threedimensional layout optimization.