期刊文献+

矩形件同质条料五块排样方式的生成算法 被引量:1

An Algorithm for Generating the Homogeneous Strips Five Block Pattern of Rectangular Pieces
下载PDF
导出
摘要 材料利用率和切割工艺复杂度是金属板材切割排样中主要考虑的两个因素。提出矩形件同质条料五块排样方式的生成算法,用以解决金属板材切割排样问题。这种算法将板材分为五个块,各块中只排放方向和长度均相同的条料。通过求解背包问题优化块中条料的布局,使得块中排放的矩形件总价值达到最大;采用隐式枚举法考察所有可能的五块组合的排样价值,选择排样价值最大的一个组合作为最终的五块排样方式。用文献中的基准测题,验证文中的五块排样算法。数值实验结果表明,文中算法在提高材料利用率和简化板材切割工艺两方面均有效,且算法计算时间较短。 Material utilization and cutting process complexity are the two main factors that be considered in the metal sheet cutting process. In order to solve the metal sheet cutting problem, this paper presents an algorithm which can generate the homogeneous strip five block pattern of rectangular pieces. This algorithm divides the sheet into five blocks, each of which consists of strips of the same length and direction. The algorithm first uses an knapsack algorithm to determine the optimal strips layout in the block and maximize the value of the pieces cut; and then uses an implicit enumeration method to consider all possible five blocks combination, from which the highest pattern value combination is selected. The algorithm was tested on benchmarks problems in the literature. The numerical experimental results show that the proposed algorithm is effective in the improving material utilization and simplify sheet cutting process , and also has a shorter computation time.
出处 《机械设计与制造》 北大核心 2016年第11期80-82,86,共4页 Machinery Design & Manufacture
基金 河南省科技厅科技攻关项目(152102210320) 河南省高等学校重点科研项目(15B52000)
关键词 矩形件 同质条料 五块方式 背包算法 隐式枚举 Rectangular Pieces Homogeneous Strip Five Block Pattern Knapsack Algorithm Implicit Enumeration
  • 相关文献

参考文献3

二级参考文献26

  • 1曹炬,周济,余俊.矩形件排样优化的背包算法[J].中国机械工程,1994,5(2):11-12. 被引量:33
  • 2崔耀东.生成矩形毛坯最优T形排样方式的递归算法[J].计算机辅助设计与图形学学报,2006,18(1):125-127. 被引量:22
  • 3M.Dorigo and LGambardella, Ant Colony System: a cooperative learning approach to the traveling salesman problem [J].IEEE Trans Evolut Comput, 1997, l( l ):53-66.
  • 4Gambardella, L.M.& Dorigo, M.Ant Colony System hybridized with a new local search for the sequential ordering problem [J].INFORMS Journal on Computing, 2000,12( 3 ):237-255.
  • 5] Marco Dorigo,Thomas Stutzle.Ant colony optimization [ M ].Massachusetts Institute of Technology Press, 2004.
  • 6Stefan Jakobs.On genetic algorithms for the packing of polygons [J]. European Journal of Operational Research, 1996, (88) : 165-181.
  • 7H. Dyckhoff. A typology of cutting and packing problems [J]. European Journal of Operational Research, 1990(44):145-159.
  • 8Nicos Christofides, Eleni Hadjiconstantinou. An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts [J]. European Journal of Operational Research, 1995(83 ) : 21-38.
  • 9E. Hopper, B.C.H. Turton. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem [J]. European Journal of Operational Research, 20.01(128) :34-57.
  • 10Wenqi Huang, Duanbing Chen. An efficient heuristic algorithm for rectangle-packing problem [J]. Simulation Modelling Practice and Theory, 2007(15) : 1356-1365.

共引文献35

同被引文献3

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部