Research Of Packing Problem Of Transformer Stalloy Based On Simulated Annealing Genetic Algorithm

Two dimensional packing problem, a kind of Non-deterministic PolynomialComplete problem with the highest computational complexity, has a wide crosstraditional boundaries of the subjects such as computational geometry, artificialintelligence, neural network and operations research. It is extensively applied tothese fields of the packing problem such as apparel, mechanical manufacture, glassand other industries. Researching on the nesting problem not only bringsincalculable economic values and social values, but also promotes the socialdevelopment oriented to the environmental protection and saving resource direction.With the constant development and update of the computer technologies, packingpattern has been developed from nesting by hand to computer aided optimal layout,from simple search algorithm to intelligent heuristic search algorithm. Otherwise,packing complexity increases as the shaping and computational complexity increases.The main work and achievements are as follows:Firstly, the paper studies deeply on the status and trend of the packing problemhome and abroad, as well as the current layout and limitations about the transformercore.In the present transformer core manufacturing basis, the paper proposes thenesting system, then establishes the nesting system’s framework, describes the basiccontents and theories in detail according as the transformer core type, shape andnumber of features.Secondly, in this layout system, the transverse layout is different from thelongitudinally layout system.Transverse discharge is intended to find out metal parttypes which is arranged into the sheet,and longitudinal layout is designed toascertain the munber of each parts arranged in the broad, making the whole layoututilization rate meet the demand.Thirdly Thirdly, In order to save Silicon steel sheet material，the transverselayout make an effort to make the sum of the parts width be close to the plate width.In the lateral direction layout, the genetic algorithm overcome the arithmetic eary maturity and the optimization results of convergence being not good enough,joinedin the simulated annealing optimization algorithm. This algorithm work out theoptimum solution in the transverse layout, ensuring the overall layout of eachtransverse layout optimal and trying the best to save silicon steel sheet.Fourthly, in the longitudinal direction of the layout,according to the“optimization theory” of dynamic programming, the paper establishes amathematical model of the nesting algorithm. Layout in this way every time, theremaining parts still use this way layout. In this way，the result will be the overalloptimal solution as long as each layout results are the best.Fifthly,Nesting programs are written under the platform of MATLAB, andstudy deeply the relationship between Sheet width and surplus material as well as therelationship between the longitudinal shear length range and dischargingutilization.In the result,we can get the most suitable sheet width and vertical shearrange.