亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

An Optimization Method for CNC Laser Combination Cutting of Irregular Plate Remainders

路径(计算) 多边形(计算机图形学) 遗传算法 过程(计算) 计算机科学 算法 工程制图 数学优化 数学 工程类 帧(网络) 电信 程序设计语言 操作系统
作者
Li Li,Zhaoyun Wu,Zhongwei Zhang,Yulan Zhang
出处
期刊:Coatings [Multidisciplinary Digital Publishing Institute]
卷期号:13 (5): 914-914 被引量:1
标识
DOI:10.3390/coatings13050914
摘要

The key research question in this study is how to cut pieces in irregular plate remainders, because there are many irregular plate leftovers created during the CNC (Computer Numerical Control) process. This will increase material utilization and allow plate leftovers to be reused. One of the issues being researched is how to arrange plate remainders on the surface of the CNC machine; this issue is known as combination layout optimization. The other issue being researched is combination cutting-path optimization of plate remainders, which aims to determine the cutting path of parts of plate remainders. A genetic algorithm based on the gravity-center NFP (No-Fit Polygon) method was applied to optimize the layout pattern, and then the geometric coordinates of a part included in one plate remainder after packing were obtained by geometric transformation with the help of a three-layer graphic data correlation model, which quickly identified the inside and outside contours of parts. A colony algorithm based on the mathematical model of cutting-path optimization was used to optimize the cutting path of the parts in the plate remainders. Finally, some simulation tests were performed to illustrate the feasibility and effectiveness of the proposed method. The results of the algorithm for packing irregular shapes for some instances show that our algorithm outperforms the other algorithms. On most instances, the average plate utilization ratio using our algorithm, after running 20 times, is improved by 1% to 9% in comparison to the best plate utilization ratio using the tree search algorithm. The best idle travel of an example achieved by the algorithm in this paper is 7632 mm after running the cutting-path optimization algorithm 20 times, while that of the traditional equivalent TSP (Traveling Salesman Problem) algorithm is 11,625 mm, which significantly demonstrates the efficiency of the algorithm.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
冷HorToo完成签到 ,获得积分10
1秒前
Copyright应助科研通管家采纳,获得10
11秒前
Kao应助科研通管家采纳,获得10
11秒前
Kao应助科研通管家采纳,获得10
11秒前
非洲大象完成签到,获得积分10
26秒前
30秒前
wenhui发布了新的文献求助10
36秒前
53秒前
余周2024发布了新的文献求助10
57秒前
Moto_Fang完成签到 ,获得积分10
1分钟前
1分钟前
1分钟前
酷波er应助欣喜从梦采纳,获得10
1分钟前
科目三应助欣喜从梦采纳,获得10
1分钟前
充电宝应助余周2024采纳,获得10
1分钟前
心想柿橙完成签到,获得积分10
2分钟前
Kao应助科研通管家采纳,获得10
2分钟前
Kao应助科研通管家采纳,获得10
2分钟前
Kao应助科研通管家采纳,获得10
2分钟前
Kao应助科研通管家采纳,获得10
2分钟前
SciGPT应助liang采纳,获得10
2分钟前
2分钟前
2分钟前
FMHChan完成签到,获得积分10
2分钟前
欣喜从梦发布了新的文献求助10
2分钟前
欣喜从梦发布了新的文献求助10
2分钟前
2分钟前
2分钟前
欣喜从梦发布了新的文献求助10
2分钟前
3分钟前
欣喜从梦发布了新的文献求助10
3分钟前
3分钟前
3分钟前
外向的妍完成签到,获得积分10
3分钟前
4分钟前
Copyright应助科研通管家采纳,获得10
4分钟前
Kao应助科研通管家采纳,获得10
4分钟前
4分钟前
4分钟前
4分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
《上海印钞厂志》 3000
2026年中国辛酸癸酸聚乙二醇甘油酯行业市场现状调查及投资机会研判报告 1000
2026年中国辛酸癸酸聚乙二醇甘油酯行业市场规模及竞争格局分析报告 1000
模型平均及其应用 900
Fundamentals of Pharmaceutical and Biologics Regulations: A Global Perspective, Second Edition 700
作者名:Kristopher P. Plain,悉尼大学的,目前只能查到其四篇论文,想找到其博士论文 550
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7338740
求助须知:如何正确求助?哪些是违规求助? 8952215
关于积分的说明 18998600
捐赠科研通 6991223
什么是DOI,文献DOI怎么找? 3218421
关于科研通互助平台的介绍 2384172
邀请新用户注册赠送积分活动 2198382