Discrete Teaching Learning-Based Optimization for Multi-Hole Drilling

V. Rathod, S. Kadam, O. P. Yadav, A. Rathore
{"title":"Discrete Teaching Learning-Based Optimization for Multi-Hole Drilling","authors":"V. Rathod, S. Kadam, O. P. Yadav, A. Rathore","doi":"10.1109/INOCON57975.2023.10101171","DOIUrl":null,"url":null,"abstract":"In manufacturing industries drilling multi-hole is one of the major operations. Hence, the drill path sequence optimization has attracted considerable attention to reduce the processing cost. Consequently, researchers have proposed the use of newly modified algorithms, hybridized as well as classical standalone evolutionary algorithms. In this study, a recently developed Discrete Teaching-Learning-Based Optimization (D-TLBO) in the domain of the TSP is proposed for optimizing the multi-hole drill path sequencing problems. To examine the performance of the D-TLBO two multi-hole drill test problems with 14 and 158 holes are used and the results are compared with the best available solutions from the literature. A D-TLBO algorithm has shown the ability to efficiently search for the optimal solution in a discrete space and a comparative study also confirms that the algorithm performs better than existing evolutionary algorithms.","PeriodicalId":113637,"journal":{"name":"2023 2nd International Conference for Innovation in Technology (INOCON)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 2nd International Conference for Innovation in Technology (INOCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INOCON57975.2023.10101171","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In manufacturing industries drilling multi-hole is one of the major operations. Hence, the drill path sequence optimization has attracted considerable attention to reduce the processing cost. Consequently, researchers have proposed the use of newly modified algorithms, hybridized as well as classical standalone evolutionary algorithms. In this study, a recently developed Discrete Teaching-Learning-Based Optimization (D-TLBO) in the domain of the TSP is proposed for optimizing the multi-hole drill path sequencing problems. To examine the performance of the D-TLBO two multi-hole drill test problems with 14 and 158 holes are used and the results are compared with the best available solutions from the literature. A D-TLBO algorithm has shown the ability to efficiently search for the optimal solution in a discrete space and a comparative study also confirms that the algorithm performs better than existing evolutionary algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在制造业中,钻多孔是主要作业之一。因此,优化钻径顺序以降低加工成本已引起人们的广泛关注。因此,研究人员提出了使用新改进的算法,杂交以及经典的独立进化算法。在本研究中,提出了一种基于TSP领域的离散教学优化方法(D-TLBO)来优化多孔钻径排序问题。为了检验D-TLBO的性能,采用了14孔和158孔两个多孔钻井测试问题,并将结果与文献中最佳的可用解决方案进行了比较。一种D-TLBO算法显示了在离散空间中有效搜索最优解的能力,并且对比研究也证实了该算法比现有的进化算法性能更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Study of Machine Learning Algorithms for Predicting Heart Disease Analysis and Evaluation of Medical Care Data using Analytic Fuzzy Process Digital Image Enhancement using Conventional Neural Network Multi-View Image Reconstruction Algorithm Based on Virtual Reality Technology Application of Web Data Mining Technology in Computer Information Management
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1