Cutting Path Optimization of Pattern Pieces in Garment Automatic Cutter
In view of the defect and shortage in cutting path automatic optimization of 2D pattern pieces in current garment automatic cutter, a new optimization method of computer is explored. If there is no cutting path optimization implemented by garment automatic cutter before cutting, some problems will be caused, such as too much unless travel and too long processing time. At present, both at home and abroad, the studies on automatic optimization in cutting preprocessing are relatively weak. According to the “segment cutting from left to right” feature of automatic cutter in cutting process, an algorithm which can be summarized as “segment and reducing point” was proposed. This algorithm combined with the solution of shortest path problem, its purpose is to seek for the approximate optimal solution of cutting path. The algorithm implemented through Visual C++ 6.0 programming. Used in production by enterprise shows that the program is simple to operate, and has a high compute speed. Averagely, unless travel in cutting process reduced more than 10%. It proves that the algorithm is feasible and efficient. Using this algorithm achieved the purpose of reducing unless travel, improving cutting efficiency and lowering the cost.
Xie Yi and Li Mi
Y. L. Li et al., "Cutting Path Optimization of Pattern Pieces in Garment Automatic Cutter", Advanced Materials Research, Vols. 129-131, pp. 973-977, 2010