一种求解圆形下料问题的快速算法

A Fast Algorithm for Cutting Problem of Circular Blanks

本文研究圆形件优化排样算法,目的是提高材料利用率。本文提出了一种新的放置算法(圆弧搜索算法,ASA),与文献中算法相比,ASA在较短的时间内产生了可以和排样领域著名的法国学者Hifi在SCI和EI检索刊物中提出的较复杂方法GA-BH在利用率方面相媲美的效果;对随机生成例题的计算结果表明,本文算法的计算时间可以满足一般实践应用的要求,所得排样方案的材料利用率较高。

The research on the cutting stock problems is to study how to generate cutting patterns to maximize material usage. This paper presents an algorithm （ASA for short）, Both benchmark and random problems are used to Lest the algorithms. The computational results of the benchmark problems indicate that the algorithms can generate cutting patterns of higher material usage in shorter times, and are comparable to those presented by Hifi who is a famous French scholar in the domain of cutting and packing. The computational results of the random problems indicate that the algorithms of this paper can generate cutting patterns of higher material usage, and the computation time is reasonable for most practical cutting problems.