Abstract:

The type of garment are different, their pattern characteristics and cutting path are not the same. The cutting path optimization problem of knitting leisure trousers is considered. Aiming at finding a minimum non-cutting path tour passing through one node from each cluster, sorted out pattern characteristics based on path optimization , given geometric expression of cut-parts contours. Based on the geometric expression , the mathematical model of cutting path is established in this paper. The optimization problem of cutting path can be formulated as a generalized traveling salesman problem. A two-step approach is presented to solve the optimization problem. At first, the cut-parts get the best cutting sequence by the ant colony algorithm. Then nearest neighbor algorithm is adopted to determine the piercing point of each contour, to obtain the finished cut optimization path. The application result shows that the algorithm can significantly reduce air travel and improve cutting efficient.