基于层次聚类模型的矩形优化排样问题研究

Research on Rectangular Packing Problem Based on the Hierarchical Clustering Model

将数据挖掘中凝聚的层次聚类思想引入矩形排样问题求解中。首先计算矩形件两两之间的结合度,将结合度最高的两个矩形件合并形成一个新的矩形件,并重复执行这一步骤,直到所有矩形件合并完成。据此编写算法程序,利用标准数据集进行仿真实验。

This paper introduces the idea of hierarchical clustering in data mining field to solve the rectangular pack- ing problem. First it calculates the combination degree between each two rectangular pieces, combines the two rectan- gles into a new one, which have the highest combination degree, and repeat this step until all the rectangles merge into one. The paper designs the procedure of algorithm and uses standard data set to get simulation experiment.