检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张禹[1,2] 白晓兰[3] 张朝彪[1] 刘永贤[1] 李宇鹏[2] 张义民[1]
机构地区:[1]东北大学机械工程与自动化学院,沈阳110819 [2]沈阳机床集团设计研究院,沈阳110142 [3]沈阳化工大学机械工程学院,沈阳110142
出 处:《机械工程学报》2014年第1期120-129,共10页Journal of Mechanical Engineering
基 金:国家自然科学基金(51205054);国家科技支撑计划(2012BAF10B11);中央高校基本科研业务费专项资金(N120403009);东北大学引进人才科研启动(26333002)资助项目
摘 要:随着经济全球化的发展,产品模块组合方法成为了快速设计出符合用户需求产品的关键技术之一。针对重要的基础装备制造产品——数控机床,以卧式数控车床为研究对象,以用户需求为驱动,提出基于实例推理的数控车床智能模块组合方法。在该方法中,建立卧式数控车床产品规划阶段质量屋及其优化模型,用来实现以定制产品的综合性能与客户技术需求相关度最大为目标的用户需求的获取与转化。采用模糊相似优先比算法进行卧式数控车床相似实例的检索。基于灰色关联分析法给出卧式数控车床相似实例的评价,从而高效智能地搜索出用户总体满意度最大化的卧式数控车床。以HTC系列数控车床为实例,验证了该方法的可行性和有效性。With the development of economic globalization, the method of the product modular combination has become a key technology to rapidly design the product satisfying customer requirements. As an important basic equipment manufacturing product, horizontal CNC lathe is considered as the research object, and a CBR-based and customer requirements-driven intelligent modular combination method for CNC lathe is put forward. In the method, the house of quality in the stage of product planning and its optimization model for horizontal CNC lathe are built to realize the acquisition and conversion of customer requirements. In the optimization model, the maximum correlation of product comprehensive performances and customer technological requirements is taken as the optimal goal. The fuzzy analogy preferred ratio algorithm is used to carry out the searching of the case. The grey relational analysis algorithm is adopted to evaluate the similar cases so that the horizontal CNC lathe with the maximum customer's overall satisfaction is efficiently and intelligently found. Taking HTC series CNC lathe as an example, the proposed method is proved to be feasible and effective.
分 类 号:TH122[机械工程—机械设计及理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.22.120.195