检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:夏然飞 褚学征[2] 李新宇[1] XIA Ran-fei CHU Xue-zheng LI Xin-yu(School of Mechanical Science & Engineering, Huazhong University of Science & Technology, Wuhan 430074, China WISDRI Engineering& Research Incorporation Limited, Wuhan 430080, China)
机构地区:[1]华中科技大学机械科学与工程学院,武汉430074 [2]中冶南方工程技术有限公司,武汉430080
出 处:《组合机床与自动化加工技术》2016年第9期138-142,148,共6页Modular Machine Tool & Automatic Manufacturing Technique
基 金:国家自然科学基金(51375004);国家科技支撑计划(2015BAF01B04)
摘 要:针对加工中心上的工艺序列规划问题,提出了一种以加工时间最短为优化目标的和声搜索求解方法。通过分析加工零件的特征关系,根据加工中心具有自动换刀和工作台转位的功能,从而采用矩阵来储存每个工序对应的刀具编号和工作台转位特征。该算法只需通过改变矩阵数据,就能自动生成所需的工艺方案,并且只用更改零件所对应的约束矩阵,就能快速实现零件的工艺序列优化。实例分析表明,在该模型下的和声搜索算法能很好地求解工艺序列规划问题,优化结果满足约束条件且提高了生产效率。To solve the optimal process planning problem on a machining center,an optimal process planning method based on harmony search algorithm and taken minimal processing times as optimization objective is proposed. Because the machining center with automatic tool change and workbench transposition function,according to the characteristics of the relationship between processing components,using the matrix to store the number of tools and workbench transposition characteristics. The algorithm is simple and easy to implement. It can automatically generate the required process by changing the matrix data. With the constraint of this matrix,an optimized process sequence was obtained quickly. An example is given to demonstrate the efficiency of this algorithm for process planning,the results satisfy the constraint and improve the production efficiency.
分 类 号:TH162[机械工程—机械制造及自动化] TG506[金属学及工艺—金属切削加工及机床]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.143.110