检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京航空航天大学民航学院,江苏南京210016
出 处:《航空学报》2010年第1期143-150,共8页Acta Aeronautica et Astronautica Sinica
基 金:国家自然科学基金-民航联合研究基金项目(60572171);江苏省自然科学基金(BK2007196);中国民用航空科技项目(MHRD0722);江苏省六大人才高峰项目(07-D-012)
摘 要:维修拆卸序列规划是产品维修性设计的重要内容。深入研究了面向维修性设计的产品拆卸建模方法,将民机产品分为部件模块与联接件两部分,构建了部件联接图模型,通过关联矩阵描述了部件模块与联接件的相互关系。分两步给出了民机产品拆卸序列规划方法:利用干涉矩阵确定部件模块的可行拆卸方向,以拆卸代价最小为目标,提出了基于有序搜索的民机产品部件模块的拆卸序列规划算法;考虑联接件的拆卸顺序,以拆卸工具更换次数最小为目标,提出了基于基因成对交叉与变异的遗传算法的完整拆卸序列优化方法。最后,结合某飞机前起落架系统给出了应用实例,阐明了本文方法的有效性。Maintenance disassembly sequence planning is an important facet of maintainability design. This article presents a thorough study of the product disassembly modeling method for maintainability design. Civil aircraft products are divided into two categories of component-modules and joint-parts,and a component-joint graph is developed by describing the relationship between them with an incidence matrix. The disassembly sequence planning method of civil aircraft products is provided in two steps. First,the disassembly direction of component-modules is determined by an interference matrix,and the disassembly sequence planning method of component-modules is proposed based on an ordered search by taking the minimum disassembly expense as the optimization objective. Second,by taking into consideration the disassembly order of joint-parts,the whole disassembly sequence planning method is proposed based on the genetic algorithm of gene pair crossover and mutation by taking the minimum tool change time as the optimization objective. Finally,an application instance is presented of the disassembly sequence of the nose landing gear system of a certain civil aircraft to illustrate the validity of this method.
关 键 词:维修性设计 拆卸序列规划 部件联接图 有序搜索 遗传算法
分 类 号:V211[航空宇航科学与技术—航空宇航推进理论与工程] TH122[机械工程—机械设计及理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.219.214