高级检索

矩形毛料无约束二维剪切排样的递归算法

Recursive Algorithm for Unconstrained Two-Dimensional Guillotine Cutting Problem of Rectangular Pieces

  • 摘要: 将板材分成一系列的板块.对于每一板块,通过优化选择一个毛料放在其左下角,并确定剪切线的方向;沿着该毛料的上边界或右边界将剩余区域分成2个更小的板块以待进一步排样.实验结果表明:该算法的时间效率可满足实际应用的需要,与其他算法相比,所给出的排样方式材料利用率较高.

     

    Abstract: The sheet is recursively cut into a series of rectangular blocks.For the current block considered,it optimally selects a piece,puts it at the left-bottom corner of the block,and determines whether the next cut should be aligned along its upper edge or right edge to get two smaller blocks for further layout. Benchmark tests reported in the literature are used to evaluate the algorithm,comparison indicates that its computation time is acceptable for practical use,and the material usage of the layout is higher than that of other algorithms.

     

/

返回文章
返回