中文摘要：

矩形布局问题属于NP-Hard问题,是一种复杂的组合优化问题。模拟退火算法（SA）和遗传算法（GA）,经常被用于求解组合优化问题。但是当问题规模较大时,存在一些难以解决的问题,如早熟现象。针对二维矩形布局问题,以动态吸引子为依据,根据各优化算法的特点,提出了一种将模拟退火算法和遗传算法思想融合的SAGA混合算法。最后通过实例证明该算法的合理性和高效性。

英文摘要：

Rectangular packing problems belong to NP-Hard Problems.It is complex combination optimization in nature.Simulated annealing algorithm（SA）and genetic algorithm（GA）are often used in solving combination optimization problem.But they have limitations with the scale of the problems being larger,such as the problem of premature convergence.The paper focuse on solving the rectangular packing problems,with the function of position of dynamic attractive factors as a basis,a hybrid algorithm is proposed in this paper.In the end,the simulation results show that the proposed algorithm is reasonable and efficient.