节点文献

基于改进的动态规划算法的优化排样的研究

Research on the Optimal Nesting Problem Based on the Improvement Dynamic Programming Algorithm

【作者】 赵丽娟

【导师】 魏福玉;

【作者基本信息】 吉林大学 , 机械电子工程, 2005, 硕士

【摘要】 本文以在剪板机上加工矩形零件毛坯的生产过程为应用背景,以实现下料生产中板材的优化排样为目标,围绕提高生产效率、合理利用原材料、降低生产成本的基本需求,提出了解决板材排样优化问题的技术思路。本文深入研究了当前的几种优化排样算法的原理和矩形零件排样优化计算求解模型提出了一种新的优化排样的方法:加入启发式策略的改进的动态规划算法;并设计了排样设计软件;同时通过三个样本的数据分析,得出了生产批量与排布次数和利用率的关系,提出了解决排布次数与利用率的不可调和的矛盾。通过大、小批量零件的两个排样实例,证明了本算法的实用性、有效性和可行性。

【Abstract】 This paper brings forward the technical thought of the nesting-problem at the background of the process of the raw material of the rectangle stock on the clipping-machine. The result of optimal placement of stock sheets is to improving the utilizing ratio of raw material and reducing the cost of the product which can improve the competition. Through investigation to a great range of article focused on nesting problem of two-dimensional parts, the author studied some defects of their algorithm in optimization nesting problem of same parts. Based on that, the paper put forward the thinking and algorithm to new auto-nesting methods: combining improvement dynamic programming algorithm with the heuristic strategies; and analysis the relation of the quantity of the production between the pictures of the layout results and the utilization of the stock sheet through three examples, based on the optimal algorithm offered in this paper, a set of software is developed to prove its validity with two computation examples.

  • 【网络出版投稿人】 吉林大学
  • 【网络出版年期】2005年 06期
  • 【分类号】TG333.21
  • 【被引频次】14
  • 【下载频次】987
节点文献中: 

本文链接的文献网络图示:

本文的引文网络