关键词: 平面切割, 路径优化, 不封闭图形, 禁忌搜索, 贪婪算法, 局部优化

Abstract: In the plane cutting process, how to confirm shorter cutting paths to reduce processing costs, reduce equipment wear and improve cutting quality is the focus of industrial applications and academic research.At present, the research on planar cutting path at home and abroad mainly focuses on closed graphics. For this reason, a greedy algorithm based on tabu search and   local   optimization of greedy criteria is proposed for the problem of unclosed graphics in the laser die-cutting industry. Firstly, the constructed greedy algorithm and the improved tabu search algorithm are combined to optimize the order of the primitives in the process, and then the local optimization coefficients of the greedy criterion are proposed to weaken the greedy algorithms “  greedy  ” idea to solve planning and optimization of processing paths. The experimental data show that the greedy algorithm and local optimization of tabu search have significant effects on the planning of the cutting path and the optimization of the idle path. The idle stroke is reduced by more than 50%, and its optimization performance is proportional to the number of primitives, which can   effectively   solve the cutting problem of unclosed primitives in the knife mold industry and other laser engraving industries.

Key words:  plane cutting, path optimization, unclosed graphic, tabu search, greedy algorithm, local optimization