检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]哈尔滨工业大学(威海)机械工程系,山东威海264209 [2]中国国际航空股份有限公司工程技术分公司,北京101312
出 处:《航空动力学报》2017年第8期1971-1977,共7页Journal of Aerospace Power
基 金:国家自然科学基金(51305096);山东省自主创新及成果转化专项资助项目(2014CGZH1101);民航科技项目
摘 要:针对多寿命件机会更换问题缺乏快速有效求解算法的难题,提出了一种启发式搜索算法。以全生命周期寿命件总成本最低为优化目标,建立了多寿命件机会更换问题优化模型,将问题解空间表达为树结构;为了提高搜索算法的效率,提出了子节点生成方法和单层节点数量控制方法;在此基础上,提出了启发式搜索算法;最后,采用数值实验和应用案例对提出算法进行了评估和验证。结果表明:算法的消耗时间、求解效果与子节点生成系数α、单层节点最大数量β存在关系;当选取合适的α和β时,算法能够在较短时间内取得较好的效果;算法能够适用于设备总寿命为200000时间单位、包含100个寿命件的较大规模的多寿命件机会更换问题。A heuristic search algorithm was proposed to solve the lack of fast and effective problem-solving algorithm of opportunistic replacement of multiple life-limited parts (LLPs).At first,an optimization model of the opportunistic replacement problem of multiple LLPs was established to minimize the total LLP cost in the whole life cycle,and the solution space was expressed as a tree structure.To improve the efficiency of the search algorithm,a child node generation method and a node number control method in single layer were proposed.Based on these,a heuristic search algorithm was proposed.Finally,the proposed algorithm was evaluated and validated by numerical experiments and an actual application case.The results show that there is a relationship between the consumed time,the solving effect and the generating coefficient of child node α as well as the maximum number of single layer node β;when selecting the appropriate α and β,the proposed algorithm can achieve good results in a relatively short period of time;the proposed algorithm can be applied to large-scale opportunistic replacement of multiple LLPs with the equipment total life of 200000 time units and including 100 LLPs.
关 键 词:机会更换 启发式搜索 维修时机 寿命件更换 航空发动机
分 类 号:V23[航空宇航科学与技术—航空宇航推进理论与工程] TH17[机械工程—机械制造及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229