二维圆形排样问题是工业设计与生产中经常遇到的问题.常规下料问题主要针对矩形或圆形等规则板材,常用算法包括模拟退火、遗传算法等.本文在分析规则板材下料算法的基础上,针对实际生产应用中更为复杂的、具有不规则边界板材下料问题,提出了一种基于人工下料思维的仿生下料算法--邻居关系算法.该算法具有很好的利用率和时效性,较好地满足了实际应用的需要.实际板材下料结果表明,平均面积利用率为75.56%,平均计算时间为13.84s.所得排样利用率与模拟退火算法相当,但排样运算时间大大缩小,适应了实际下料需求,已应用于某跨国企业优化下料中.
This paper studied the problem of packing unequal circles into a irregular container. It is concerned with the development of a customized circle packing algorithm for a manufacturer of parts for industry. Practical constraints show that this problem differs somewhere from those tackled in some literature. This is accomplished by using nearest neighbors to preserve the layout structure. The nearest neighbors is developed from human designed. Empirical evidence based on similar real data shows that the quality of the resulting solutions is not worse cutting patterns currently produced by human experts. The average container's area usage is75.56% with an average runtime of 13.84seconds. Numerical Experimental results demonstrate that the algorithm proposed is fairly efficient for solving the rectangle and circle packing problem.