|
摘要：
|
|
分段排样方式用于大型发电机定子、转子的圆形和扇形两种迭片的下料。在下料排样图中，一根条带所布局的片型和尺寸必须相同，最多可出现3排迭片。为了简化切割工艺，板材中两个段的条带方向相同，且同一段中的条带长度相同。提出一种生成两段式的混合排样算法，混合的迭片包括圆片和扇片。提出扇片的转置布局，扇片在条带中有竖向放置与横向放置两种形式。使用规范长度作为断点的选择范围，规范长度集中元素的选择与迭片的步长有关。根据最佳断点方法确定整个板材中最优段的划分，然后采用动态规划方法确定每个段中的条带最优布局，最后，运用顺序价值修正启发式算法求解最终的下料方案。实验结果表明，本文算法可明显提高用于生产迭片的材料利用率，从而降低企业的生产成本。
|
|
The segmented layout method is used for the blanking of round and sector laminations for stator and rotor in large generators. However, in the layout diagram of blanking, the lamination shape and size of a strip must be the same, and there can be up to three rows of laminations. In order to simplify the cutting process, the strip direction of two sections in the sheet is the same, and the strip length in the same section is the same. Therefore, a two-stage mixed layout algorithm was proposed, and the mixed laminations included round lamination and sector lamination. Then, the transposed layout of the sector lamination was proposed, and the sector laminations were placed vertically or horizontally in the strip. Furthermore, the specification length was used as the selection range of breakpoints, and the selection of elements in the specification length set was related to the step length of lamination. According to the optimal breakpoint method, the division of the optimal section in the whole sheet was determined, and then the optimal layout of strips in each section was determined by dynamic programming. Finally, the final blanking scheme was solved by the sequential value modification heuristic algorithm. Experimental results show that the algorithm in this paper significantly improves the utilization rate of materials used to produce laminations, and the production cost of enterprises reduces.
|
|
基金项目：
|
|
国家自然科学基金资助项目(71371058);广西自然科学基金资助项目(2020GXNSFAA159090)
|
|
作者简介：
|
|
陈燕（1975-），女，博士，教授，E-mail：gxcy@foxmail.com；通讯作者：胡小春（1974-），男，硕士，副教授，E-mail：huxch999@163.com
|
|
参考文献：
|
[1]崔耀东.计算机排样技术及其应用[M].北京:机械工业出版社, 2004.
Cui Y D.Computer Layout Technology and Its Application [M].Beijing: China Machine Press, 2004.
[2]Cui Y D.A cutting stock problem and its solution in the manufacturing industry of large electric generators [J].Computers & Operations Research, 2005, 32 (1): 1709-1721.
[3]陈菲, 刘勇, 刘睿, 等.基于3块方式的圆形片剪冲排样算法[J].计算机工程, 2009, 35(14): 195-196,220.
Chen F, Liu Y, Liu R, et al.Cutting and puching layout algorithm for circle blanks based on three blocks pattern[J].Computer Engineering, 2009, 35(14): 195-196,220.
[4]Cui Y D, Wu J L, Chen H C.Generating multi-section silicon steel sheet cutting patterns in the manufacturing industry of electric generators[J].The International Journal of Advanced Manufacturing Technology, 2007, 32: 310-314.
[5]Cui Y D, Chen Y Y, Wu J L.Selecting the best sheet length for the steel stock used in circular blank production[J].IIE Transactions, 2006, 38 (10): 829-836.
[6]王岩, 潘卫平, 胡钢.生成圆形片最优四块排样方式的确定性算法[J].机械设计与制造, 2015, (9): 152-155.
Wang Y, Pan W P, Hu G.Deterministic algorithm for generating four-block cutting patterns of circular blanks [J].Machinery Design & Manufacture, 2015, (9): 152-155.
[7]陈燕, 刘咏, 谢琪琦,等.基于梯形和平行四边形的圆片剪冲下料算法设计与实现[J].图学学报, 2016, 37(5): 661-667.
Chen Y, Liu Y, Xie Q Q, et al.An algorithm for circle cutting stock problem based on trapezoid and parallelogram [J].Journal of Graphics, 2016, 37(5): 661-667.
[8]陈燕, 谢琪琦, 刘咏, 等.圆形件下料顺序分组启发式算法的设计与实现[J].图学学报, 2017, 38(1): 5-9.
Chen Y, Xie Q Q, Liu Y, et al. The cutting stock problem of circular items based on sequential grouping heuristic algorithm[J].Journal of Graphics, 2017, 38(1): 5-9.
[9]王婷婷, 崔耀东, 陈燕, 等.考虑余料生成及利用的圆片下料算法[J].锻压技术, 2019, 44(4): 40-47.
Wang T T, Cui Y D, Chen Y, et al.An algorithm of circular piece cutting stock considering generation and utilization of margin[J].Forging & Stamping Technology, 2019, 44(4): 40-47.
[10]杨剑, 黄少丽, 侯桂玉, 等.圆片剪冲下料排样算法[J].计算机工程与设计,2010,31 (23): 39-42.
Yang J, Huang S L, Hou G Y, et al.Packing algorithm for circle cutting stock problem[J].Computer Engineering and Design, 2010,31 (23): 39-42.
[11]胡钢, 杨瑞, 潘立武.基于价值修正的圆片下料顺序启发式算法[J].图学学报, 2016, 37(3): 337-341.
Hu G, Yang R, Pan L W.Sequential value correction heuristic algorithm for circle cutting stock problem [J].Journal of Graphics, 2016, 37(3): 337-341.
|
|
服务与反馈：
|
|
【文章下载】【加入收藏】
|
|
|
|
