Cutting Parameters Optimization and Constraints Investigation for Turning Process by GA with Self-Organizing Adaptive Penalty Strategy

Nafis Ahmad, Tomohisa Tanaka, Yoshio Saito
{"title":"Cutting Parameters Optimization and Constraints Investigation for Turning Process by GA with Self-Organizing Adaptive Penalty Strategy","authors":"Nafis Ahmad, Tomohisa Tanaka, Yoshio Saito","doi":"10.1299/JSMEC.49.293","DOIUrl":null,"url":null,"abstract":"For efficient use of machine tools at optimum cutting condition, it is necessary to find a suitable optimization method, which can find optimum feasible solution rapidly and explain the constraints as well. As the actual turning process parameter optimization is highly constrained and nonlinear, a modified Genetic Algorithm with Self Organizing Adaptive Penalty (SOAP) strategy is used to find the optimum cutting condition and to get clear idea of constraints at the optimum condition. Unit production cost is the objective function while limits of the cutting force, power, surface finish, stability condition, tool-chip interface temperature and available rotational speed in the machine tool are considered as the constraints. The result shows that our approach of GA with SOAP converges quickly by focusing on the boundary of the feasible and infeasible solution space created by constraints and also identifies the critical and non-critical constraints at the optimum condition.","PeriodicalId":151961,"journal":{"name":"Jsme International Journal Series C-mechanical Systems Machine Elements and Manufacturing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jsme International Journal Series C-mechanical Systems Machine Elements and Manufacturing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1299/JSMEC.49.293","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

For efficient use of machine tools at optimum cutting condition, it is necessary to find a suitable optimization method, which can find optimum feasible solution rapidly and explain the constraints as well. As the actual turning process parameter optimization is highly constrained and nonlinear, a modified Genetic Algorithm with Self Organizing Adaptive Penalty (SOAP) strategy is used to find the optimum cutting condition and to get clear idea of constraints at the optimum condition. Unit production cost is the objective function while limits of the cutting force, power, surface finish, stability condition, tool-chip interface temperature and available rotational speed in the machine tool are considered as the constraints. The result shows that our approach of GA with SOAP converges quickly by focusing on the boundary of the feasible and infeasible solution space created by constraints and also identifies the critical and non-critical constraints at the optimum condition.
基于自组织自适应惩罚策略的遗传算法车削加工切削参数优化及约束研究
为了使机床在最佳切削条件下有效使用,需要找到一种合适的优化方法,该方法既能快速找到最优可行解,又能解释约束条件。针对实际车削工艺参数优化具有高度约束和非线性的特点,采用改进的遗传算法结合自组织自适应惩罚(SOAP)策略寻找最优切削条件,明确了最优切削条件下的约束条件。以单位生产成本为目标函数,以切削力、功率、表面光洁度、稳定性条件、刀屑界面温度和机床可用转速为约束条件。结果表明,基于SOAP的遗传算法通过关注约束产生的可行和不可行解空间的边界来快速收敛,并在最优条件下识别出关键和非关键约束。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信