Multi-Objective Cutting Parameter Optimization Method for the Energy Consumption and Machining Quality of Computerized Numerical Control Lathes

Author:

Li Jian12,He Pengbo1,Li Huankun1,Li Shifa1,Xu Liping12,He Kui12

Affiliation:

1. School of Mechatronics Engineering, Henan University of Science and Technology, Luoyang 471000, China

2. High-End Bearing Collaborative Innovation Center of Henan Province, Luoyang 471000, China

Abstract

In order to achieve minimum energy consumption in computerized numerical control (CNC) lathe processing under the premise of ensuring the imposed roughness of the machined surface, a black hole-continuous ant colony optimization algorithm (BH-ACOR) is proposed to optimize the turning parameters. Taking turning specific energy and surface roughness as the optimization objectives, a turning test was designed. Subsequently, a multi-objective mathematical model of the cutting stage was formulated through the application of the least-squares method to fit the test data. The black hole algorithm was introduced to mitigate the shortcomings of the continuous-domain ant colony algorithm, which easily falls into a local optimum, so as to put forward a kind of BH-ACOR that is applicable to multi-objective optimization. The algorithm was applied to the multi-objective mathematical model in the turning stage to determine the optimal cutting parameters. Through simulation and test verification, the validity and practicability of the proposed method are further proved.

Funder

National Key R&D Program of China

Key Research Projects of Henan Province

Publisher

MDPI AG

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3