检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张胜博 张松[1,2] ZHANG Sheng-bo;ZHANG Song(Key Laboratory of High Efficiency and Clean Machinery Manufacturing,Ministry of Education,Shandong University,Jinan 250061,China;National Experimental Teaching demonstration Center of Mechanical Engineering,Shandong University,Jinan 250061,China)
机构地区:[1]山东大学高效洁净机械制造教育部重点实验室,济南250061 [2]山东大学机械工程国家级实验教学示范中心,济南250061
出 处:《组合机床与自动化加工技术》2022年第7期90-94,98,共6页Modular Machine Tool & Automatic Manufacturing Technique
基 金:山东省重大科技创新工程(2019JZZY010437);山东省泰山学者工程专项(ts201712002)。
摘 要:针对箱体零件结构复杂、面孔特征多等特点,提出一种基于改进遗传算法的工步排序优化法。在分析箱体零件工艺特征和立卧镗铣加工中心工作方式的基础上,针对工步排序问题探究了主轴快速移动、工件转位和刀具更换对辅助加工时间的影响,并以辅助加工时间为目标函数建立了工步排序优化模型,利用多色集合理论构建工步优先关系约束矩阵,以确保工步顺序满足工艺约束原则,并通过改进的遗传算法获得了辅助加工时间最短的工步序列。经过工步排序优化有效降低了目标零件的辅助加工时间,提高了生产效率。Aiming at the characteristics of complex structure and many face and hole features of box parts,an optimization method of machining step sequencing based on improved genetic algorithm is proposed.Based on the analysis of the working mode of the machining center,the influence of rapid spindle movement,workpiece transposition and tool change on auxiliary processing time was explored.An optimization model of step sequence was established by taking the auxiliary processing time as the objective function,and the operation precedence constraint matrix was constructed by using the polychromatic set theory to ensure that the step sequence met the process constraint principle.The step sequence with the shortest auxiliary processing time was obtained by using the improved genetic algorithm.After the optimization of work step sequencing,the auxiliary processing time of target parts was effectively reduced and the production efficiency was improved.
关 键 词:箱体零件 辅助加工时间 工步排序 多色集理论 遗传算法
分 类 号:TH162[机械工程—机械制造及自动化] TG502[金属学及工艺—金属切削加工及机床]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:52.14.165.32