检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:徐昌鸿[1] 张树生[1] 王洪申[2] 李秀玲[1] 黄波[1] Xu Changhong Zhang Shusheng Wang Hongshen Li Xiuling Huang Bo(The Key Laboratory of Contemporary Designing and Integrated Manufacturing Technology,Ministry of Education,Northwestern Polytechnical University,School of Mechanical & Electronical Engineering,Lanzhou University of Technolog)
机构地区:[1]西北工业大学现代设计与集成制造技术教育部重点实验室,陕西西安710072 [2]兰州理工大学机电工程学院,甘肃兰州730050
出 处:《西北工业大学学报》2016年第6期1004-1010,共7页Journal of Northwestern Polytechnical University
基 金:国家自然科学基金(51375397)资助
摘 要:为了实现已有数控工艺重用方法在零件工艺规划中的有效应用,提出了一种面向多局部结构数控工艺重用的工艺方案优化方法。首先,构建工艺优化目标函数的数学模型;然后依据检索到的多个相似局部结构可重用数控工艺,提出一种面向局部结构的备选数控工艺方案集生成方法;依据工艺可重用度,采用轮盘赌算法为待设计局部结构选择一个数控工艺方案,构建待设计零件的加工操作顺序图(OPG);最后,提出一种基于OPG的蚁群算法,得到最优数控工艺方案。实验结果证明,该方法能有效生成零件的最优数控工艺方案,提高了数控工艺的编制效率。To realize the effective application of existing NC process reuse approaches in the domain of process planning for parts,a NC process reuse oriented process planning optimization approach was proposed. Firstly,the mathematical model of the objective function for process planning optimization was established. Secondly,based on the multiple similar subparts associated with reusable NC process,a NC process candidates generation method for query subparts was elaborated. The NC process for each query subpart was selected using the roulette wheel approach in terms of the reusability,and the operation precedence graph( OPG) of the query part was constructed.Finally,an OPG based ant colony algorithm was introduced to obtain the optimal NC process scheme for the query part. Experimental results showed that our approach could effectively produce the global optimal NC process scheme for parts and significantly improve the efficiency of NC programming.
关 键 词:数控工艺重用 相似局部结构 优化 加工操作顺序图
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229