【作者】 唐生利；

【导师】 王耘； 宋小文；

【作者基本信息】 浙江大学 ， 机械设计及理论， 2007， 硕士

【摘要】 在机械制造行业里，排样主要研究零件的布局，目的是提高材料利用率，同时满足加工工艺的要求。人工排样效率低，难以得到高质量的排样方案。计算机辅助排样技术充分利用计算机的快速计算优势，可以在较短的时间内得到较优的排样方案，从而提高生产效率，降低生产成本，增强企业竞争力。本文研究了排样类别的划分方法，根据零件毛坯的种类、数量、加工工艺三者之间的关系细化了每一大类排样问题。本文总结了排样理论和算法的研究现状和发展趋势，分析了典型排样算法的优点和不足。本文详细论述了连分数算法，将连分数算法应用于单一矩形件排样，设计了单一矩形排样的无约束排样、有约束排样、板材分割算法，可以达到单一矩形排样的最优排样和板材的最优分割。本文将连分数算法应用于条带单一排样，采用分区计算的方法精确计算板材可以排放毛坯的最大个数，与分支定界算法结合，设计了单一条带排样的无约束排样、有约束排样、板材分割算法，可以达到单一条带排样的最优排样和板材的最优分割。本文分析了冲裁条带排样研究中的两个极端情况，提出了根据条带在板材上的排样结果来寻求最优的条带排样参数的方法，将两大领域有机统一起来，从而实现条带排样参数的全局寻优。本文分析了当前求解排样参数的几种典型算法的优点和不足，提出了结合平行线化和顶点碰撞特性的思想，采用边界划分、子边界离散、子边界凸顶点信息提取等方法，使计算具有目的性，使预处理信息具有可重用性，从而快速计算包括嵌套排样在内的所有情况下的排样参数，这种方法同样适用于不规则零件排样的解码计算和其它需要求解毛坯间距的情况。更多还原

【Abstract】 In the industry of mechanical manufacturing, packing is to research how to lay parts on the stuff to achieve higher material utilization ratio and better process technics. The traditional manual packing method impedes corporation’s development because of its inefficiency and its inferior packing quality. Computer Aided Packing is much more effective, could gain packing projects whose quality are better in much less time. So it can enhance corporation’s competition by improving operating efficiency and reduce operating costs.The methods sorting packing are researched. Based on the num of parts sort, the num of every part, the process technic, every sort of packing problem is subdivided.State-of-the-art and future trends of packing theory and algorithm is summarized. Typical packing algorithms’ merit and disadvantage are analyzed.Continue fractions algorithm is discussed. Based on continue fractions algorithm, an effective packing algorithm for rectangular blanks of a single size based on cutting craft is put forward, a new algorithm applied in cutting a long rectangular sheet into several sections is also discussed, a packing algorithm using in the case where the blank’s num is certain is designed. They all could get best result.Continued fractions algorithm is applied in packing for punch strips of a single type. A method using to calculate the most number of pieces through the way of subdividing the sheet info several sections is discussed. Two packing algorithms using in the case the number of pieces is certain and not are put forward. A subdividing stuff algorithm is offered. They all could get best result.The two extremeness of the research about strip packing are analyzed. A new method optimizing strip packing parameters based on the packing result of strip on the stuff is considered, unifying two main research areas.The merit and disadvantage of typical packing algorithms for punch strip are analyzed. An idea integrating parallel and vertex is put forward. Through dividing and dispersing borderline, distilling the information of protruding vertexes, the calculation is purposeful, the information could be reused. The method could get strip packing parameters in much less time, no matter nesting packing or not. The method is also in point in decoding for irregular-shaped parts and other case needing calculate the distance of two parts.更多还原