检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:汪岚[1] 陈海洋[1] WANG Lan;CHEN Haiyang(College of Mechanical and Electrical Engineering,Liming Vocational University,Quanzhou 362000,China)
机构地区:[1]黎明职业大学智能制造工程学院,福建泉州362000
出 处:《延边大学学报(自然科学版)》2021年第1期75-79,共5页Journal of Yanbian University(Natural Science Edition)
基 金:泉州市高层次人才创新创业项目(2019C045R)。
摘 要:为了减少皮革自动裁剪过程中的走刀时间,以空行程路径距离最短为优化目标构建了一个裁剪路径的数学优化模型,并采用分类优化算法对模型进行了求解,求解思路为:首先用坐标中心点最近原则确定样片外轮廓裁剪起始点集合,其次用改进蚁群算法优化样片裁剪顺序,最终获得空行程的最优路径.实验结果表明,该优化算法求解的空行程路径比优化前缩短了34.5%,由此表明该优化方法可显著提高皮革裁剪效率,具有良好的应用价值.In order to reduce time in leather cutting process, a model was built based on the objective function of minimum null travel path length, and a classification optimization algorithm was applied to solve the model. The solution of the optimization algorithm is as follows: first all sample’s cutting point were determined by principle of nearest center point of coordinates, then the cutting sequence were determined by improved ant colony algorithm, finally a optimal null travel path was obtained. The results show that the distance of null travel path is shortened by 34.5% compared with that before optimization, thus the optimization method can significantly improve the leather cutting efficiency and has good application value.
关 键 词:空行程路径 分类优化算法 坐标中心点 改进蚁群算法
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49