Font Size: a A A

The Research Of Automatic Intelligent CNC Cutting Lathe Base On Garment CAD

Posted on:2008-09-13Degree:MasterType:Thesis
Country:ChinaCandidate:Y C XueFull Text:PDF
GTID:2121360218952795Subject:Computer software and theory
Abstract/Summary:PDF Full Text Request
The continuous improvement of garment CAD, the core part of which is the optimal layout, promotes the development of clothing industry. It belongs to the NP-complete problem with tiptop calculate complexity, but cannot find the effective algorithm up to the present. A good packing scheme can not only economize raw material but also reduce the production cost. Thus, research on the problem of two-dimensional optimal layout is significant in theory and applications. Particularly, the two-dimensional optimal layout has being regard and study. Based on thought and analysis of the optimal layout problem, two steps are adopted. Two steps mean that converting the problem into a rectangular part layout problem by calculating the surrounding boxes of irregular parts and then optimizing the rectangular layout.In this paper, genetic Algorithm (GA), particle swarm optimization (PSO) and especially Quantum-Behaved Particle Swarm (QPSO) are discussed, and then the method of rectangle packing is designed. The experimental results demonstrate that the algorithm proposed, which is get rectangular packing regarding evolutionary algorithm has good performance. Found on the foundation that two-dimensional irregular parts layout problem has been transformed into two-dimensional rectangular parts layout problem, the mathematical model of rectangular parts layout problem is established with heuristic algorithm, then convert it into a problem of permutation. Betaking GA, PSO and QPSO to optimize two dimensions rectangular parts optimal layout problem, accordingly the whole solution space can be searched effectively. In the processing of the evolution computation the rule of self-adapting is adopted, ultimately, the high utilization ratio of material of the layout result is acquired. The examples of layout reveal that the convergence speed of QPSO is faster than PSO and GA, consequently the optimal algorithm based on QPSO has general applicability.The results show that QPSO algorithm not only has fewer parameters and stronger stochastic property but also can cover the whole solution space, at the same time assure global convergence. QPSO algorithm is better than other evolutionary algorithm in rectangle-packing problem and rectangular parts optimal layout problem.
Keywords/Search Tags:Garment CAD, Rectangle-packing, Two-dimensional rectangular parts layout, Heuristic algorithm, Particle Swarm Optimization, Quantum-Behaved
PDF Full Text Request
Related items