自动化与信息工程2025，Vol.46Issue(2)：9-17,9.DOI:10.12475/aie.20250202
基于K-means与2-Opt改进的贪心路径优化算法研究
Research on an Improved Greedy Path Optimization Algorithm Based on K-means and 2-Opt
摘要
Abstract
Aiming at the problem that current garment cutting path optimization algorithms cannot simultaneously satisfy high precision and low time consumption,this paper proposes an improved greedy path optimization algorithm based on K-means and 2-Opt.First,the K-means clustering algorithm is used for local grouping of large-scale traveling salesman problems.Then,a 2-Opt improved greedy algorithm is adopted to optimize the path.Finally,the nearest neighbor connection method is employed to connect solutions of sub-problems between clusters.Experimental results verify that the proposed algorithm demonstrates superior path and efficiency optimization capabilities.关键词
衣物裁剪路径优化/K-means聚类算法/2-Opt算法/贪心算法Key words
garment cutting path optimization/K-means clustering algorithm/2-Opt algorithm/greedy algorithm分类
计算机与自动化引用本文复制引用
黄启华,冯子俊,杜玉晓,王烁哲..基于K-means与2-Opt改进的贪心路径优化算法研究[J].自动化与信息工程,2025,46(2):9-17,9.基金项目
国家自然科学基金(61976059,61640213) （61976059,61640213）
