关键词: 卷材排样问题, 圆形件, 优化排样, 排样算法, 定序定位算法

Abstract: The problem of circular parts coiled sheet packing means that a set of different radius
circular parts are non-overlappingly packed on the coiled sheet with specified width, so that the
occupied length of the coiled sheet is minimized. To solve this problem, a sequential positioning
heuristic optimization algorithm is proposed. A positioning algorithm is designed based on maximum
caving degree. For each particular packing sequence, caving degrees of all feasible placement
location of circular parts are calculated, and the location which has the highest caving degree is
selected to pack the circular part. The current layout is updated, and the packing of the residual
circular parts is continued, according to the above rule until all of circular parts are packed into the
coiled sheet. Genetic algorithm is employed to evolve the packing sequence, in order to obtain a great
number of different packing schemes, and the packing scheme with the minimum coiled sheet length
is chosen as the final solution. The experimental results show that the algorithm scheduling scheme of
this paper consumes less coil length, and the calculation time of the algorithm is relatively reasonable.

Key words: coiled sheet packing problem, circular parts, packing optimization, packing algorithm, sequential positioning algorithm