Research And Development Of Computer Aided Packing System For Mechanical Manufacture

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.