期刊文献+

一维下料问题的多叉树遍历算法研究

Research on Multi-Branches Tree Traversal Algorithm of One-Dimensional Cutting Stock Problem
在线阅读 下载PDF
导出
摘要 切割条形材料,获得不同长度工件问题普遍存在。为满足原材料利用率最大的实际加工要求,将数据建立为多叉树模型,添加剪枝优化条件,使用深度优先遍历,递归调用深度优先遍历函数,搜索全局最优解,即最优化的下料方案。使用其他论文中的实例,对比启发式多级序列线性优化方法的运算结果。对比结果表明:多叉树遍历算法的材料利用率最高、结果更优。 The problems,that cut bar materials and obtain workpieces in different length,are ubiquitous.In order to satisfy the practical machining requirement of maximum utilization of raw stock,in this paper,the data was established into multi-branches tree model.Adding pruning optimization conditions,applying depth-first traversal,recursively calling depth-first traversal functions,and searching global optimal solutions,the optimized cutting stock scheme would be obtained.Citing practical examples in other paper,the operation result of heuristic multi-sequential linear optimization method was expected to be compared.The comparison result shows that the raw stock utilization of multi-branches tree traversal algorithm is higher,and the result is better.
作者 杨畅 杨林 沈竹楠 YANG Chang;YANG Lin;SHEN Zhu-nan(School of Mechanical Engineering,Shenyang University of Technology,Shenyang 110370,China)
出处 《机械工程与自动化》 2018年第4期11-12,15,共3页 Mechanical Engineering & Automation
基金 国家科技支撑计划项目(2015BAH47F02)
关键词 多叉树 剪枝优化 深度优先遍历 全局最优解 下料 multi -branches tree pruning optimization depth- first traversal global optimal solution cutting stock
  • 相关文献

参考文献4

二级参考文献33

  • 1陈炼,马永生,刘光明.一维下料方案的贪心算法优化[J].南昌大学学报(工科版),2005,27(4):71-73. 被引量:9
  • 2李培勇,王呈方,茅云生.基于基因群体的一维优化下料[J].上海交通大学学报,2006,40(6):1015-1018. 被引量:6
  • 3龚坚,刘飞,徐宗俊.定长条材优化下料的实用算法研究[J].重庆大学学报(自然科学版),1997,20(1):92-97. 被引量:5
  • 4YANG C T, SUNG T C, WENG W C. An improved tabu search approach with mixed objective function for one-dimensional cutting stock problems [J]. Advances in Engineering Software, 2006, 37(8): 502-513.
  • 5LIANGK H, YAO X, NEWTON C, et al. A new evolutionary approach to cutting stock problems with and without contiguity [J].Computers and Operations Research, 2002, 29(12) : 1641-1659.
  • 6CHEN C L S, HART S M, THAM W M. Simulated annealing heuristic for the one-dimensional cutting stock problem [J]. European Journal of Operational Research, 1996, 93(3) :522-535.
  • 7BLUM C, ROLI A. Metaheuristics in combinatorial optimization, overview and conceptual comparison[J]. ACM Computing Surveys, 2003, 35(3): 268-308.
  • 8SIMON H A.现代决策理论的基石[M].北京:北京经济学院出版社,1989.
  • 9HAESSLER R W, SWEENEY P E. Cutting stock problems and solution procedures [J]. European Journal of Operational Research, 1991, 54(2): 141-150.
  • 10GRADIAR M, RESINOVIC G, KLJAJI M. Evaluation of algorithms for one-dimensional cutting [J].Computers and Operations Research, 2002, 29(9) : 1207-1220.

共引文献29

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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