Analysis And Optimization Of Garment Cutting Path

Garment automatic cutting system can effectively improve the production automationdegree of the enterprise and product quality, reduce the influence of artificial factors andreduce labor, cost reductions as well as. It is the inevitable developing trend of garmentprocessing technology. And its advanced level have a decisive impact for garmentprocessing production. At present, garment automatic cutting beds of domestic garmententerprises are universal, for different style of clothing is to use the same cutting process,cutting path is not targeted. Cutting tool path of automatic cutting bed is complicated. Thetype of clothes are different, their cutting tool path is not the same. The cutting pathoptimization of knitting leisure trousers is further studied in this dissertation.First, the significance of the topic and the domestic, foreign research status, thecharacteristics of the discharge plan and the mathematical model of cutting path areintroduced. Then the cutting path optimization method of knitting leisure trousers arediscussed, including ant colony algorithm, nearest neighbor algorithm and common linecutting algorithm. In this paper we consider the cutting path optimization method ofknitting leisure trousers.The relationship between discharge characteristics and characteristics of cutting pathis close. This abstract is based on analysis of some enterpriser’s layout as object of study.Using the actual examples of layouts contrast and using methods of mathematical statisticsetc. From template characteristics, template outline features etc. to different layout planconducting characteristical refine and analysis the connection between dischargecharacteristics and cutting path.In this thesis, according to the characteristics of the automatic cutting, we extract thecut-parts outlines of the knitting leisure trousers. In the point of the characteristics of thelayout planning, because of the idle stroke problem in automatic cutting, an ant colonyalgorithm to optimize the cutting path is presented. At first, the algorithm get the best cutting sequence by the ant colony algorithm. Then nearest neighbor algorithm isadopted to determine the piercing point of each contour, to obtain the cut optimization pathof knitting leisure trousers.There are many common line in some layout maps of knitting leisure trousers.According to the problem, we project common line cutting optimized path arithmetic. Thecommon line cutting algorithm uses the edge pieces and mixed cropping single pieces. Atfirst, the algorithm get the best cutting sequence by the ant colony algorithm. Thencommon line cutting algorithm is adopted to determine the beginning and end point of eachcontour, the beginning and end point of monolithic cut-parts is the same, the beginning andend point of the common line cut-parts is not consistent, to obtain the cut optimization pathof knitting leisure trousers.The cutting path optimization problem in knitting leisure trousers are studied in thisdissertation, for which ant colony optimization algorithm and common line cuttingoptimization algorithm are presented, whose effectiveness is tested in computationaltrials.