A Novel Approach to Optimize Numerical Control Codes Using a Systematic Block Management Method

Q4 Computer Science
Leapheng Uon, C. Ng, Francis Gregory Ng, Sharaful-Ilmi Abdulkadir Paduman, A. Chua
{"title":"A Novel Approach to Optimize Numerical Control Codes Using a Systematic Block Management Method","authors":"Leapheng Uon, C. Ng, Francis Gregory Ng, Sharaful-Ilmi Abdulkadir Paduman, A. Chua","doi":"10.5875/AUSMT.V9I1.1728","DOIUrl":null,"url":null,"abstract":"The numerical control (NC) codes generated from Computer Aided Manufacturing (CAM) software follow the sequence of adding elements to the design. As an alternative, it would be quite beneficial in cost-reduction to optimize the manufacturing sequence to minimize the run time. Accordingly, this paper introduces a novel approach to optimize the numerical control codes generated from a CAM software package using a systematic block management method. To improve the drilling sequence, contours are also considered as block entities in a traveling salesman problem (TSP) with modifications to systematically manage the blocks of code that define the contours. A MATLAB program was created to automatically optimize the numerical codes from a CAM software translator. Because of easier usage and good performance, a partitioned approach for the λ-opt algorithm was implemented instead of the Lin-Kernighan Heuristic (LKH) that has been extensively proven to be effective in optimizing the traveling salesman problem. The new approach was simulated on sample designs and has been shown to achieve at least 15.52% reduction in airtime and 11.32% reduction in tool travel distance. Experimental data showed a 13.45% decrease in total milling time. This work is licensed under a  Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License .","PeriodicalId":38109,"journal":{"name":"International Journal of Automation and Smart Technology","volume":"9 1","pages":"23-32"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Automation and Smart Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5875/AUSMT.V9I1.1728","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0

Abstract

The numerical control (NC) codes generated from Computer Aided Manufacturing (CAM) software follow the sequence of adding elements to the design. As an alternative, it would be quite beneficial in cost-reduction to optimize the manufacturing sequence to minimize the run time. Accordingly, this paper introduces a novel approach to optimize the numerical control codes generated from a CAM software package using a systematic block management method. To improve the drilling sequence, contours are also considered as block entities in a traveling salesman problem (TSP) with modifications to systematically manage the blocks of code that define the contours. A MATLAB program was created to automatically optimize the numerical codes from a CAM software translator. Because of easier usage and good performance, a partitioned approach for the λ-opt algorithm was implemented instead of the Lin-Kernighan Heuristic (LKH) that has been extensively proven to be effective in optimizing the traveling salesman problem. The new approach was simulated on sample designs and has been shown to achieve at least 15.52% reduction in airtime and 11.32% reduction in tool travel distance. Experimental data showed a 13.45% decrease in total milling time. This work is licensed under a  Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License .
一种利用系统块管理方法优化数控代码的新方法
从计算机辅助制造(CAM)软件生成的数控(NC)代码遵循向设计添加元素的顺序。作为替代方案,优化制造顺序以最小化运行时间在降低成本方面是非常有益的。因此,本文介绍了一种利用系统块管理方法优化CAM软件包生成的数控代码的新方法。为了改进钻孔顺序,在旅行商问题(TSP)中,轮廓也被视为块实体,并进行了修改,以系统地管理定义轮廓的代码块。创建了一个MATLAB程序来自动优化CAM软件翻译器中的数字代码。由于更容易使用和良好的性能,实现了λ-opt算法的分区方法,而不是Lin Kernighan启发式算法(LKH),该算法已被广泛证明在优化旅行商问题方面是有效的。新方法在样本设计上进行了模拟,并已被证明至少可减少15.52%的飞行时间和11.32%的刀具行程距离。实验数据显示,总铣削时间减少了13.45%。本作品根据知识共享署名非商业NoDerivatives 4.0国际许可证获得许可。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Automation and Smart Technology
International Journal of Automation and Smart Technology Engineering-Electrical and Electronic Engineering
CiteScore
0.70
自引率
0.00%
发文量
0
审稿时长
16 weeks
期刊介绍: International Journal of Automation and Smart Technology (AUSMT) is a peer-reviewed, open-access journal devoted to publishing research papers in the fields of automation and smart technology. Currently, the journal is abstracted in Scopus, INSPEC and DOAJ (Directory of Open Access Journals). The research areas of the journal include but are not limited to the fields of mechatronics, automation, ambient Intelligence, sensor networks, human-computer interfaces, and robotics. These technologies should be developed with the major purpose to increase the quality of life as well as to work towards environmental, economic and social sustainability for future generations. AUSMT endeavors to provide a worldwide forum for the dynamic exchange of ideas and findings from research of different disciplines from around the world. Also, AUSMT actively seeks to encourage interaction and cooperation between academia and industry along the fields of automation and smart technology. For the aforementioned purposes, AUSMT maps out 5 areas of interests. Each of them represents a pillar for better future life: - Intelligent Automation Technology. - Ambient Intelligence, Context Awareness, and Sensor Networks. - Human-Computer Interface. - Optomechatronic Modules and Systems. - Robotics, Intelligent Devices and Systems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信