位置:成果数据库 > 期刊 > 期刊详情页
Optimizing combination of aircraft maintenance tasks by adaptive genetic algorithm based on cluster search
  • ISSN号:1004-4132
  • 期刊名称:《系统工程与电子技术:英文版》
  • 时间:0
  • 分类:TP273[自动化与计算机技术—控制科学与工程;自动化与计算机技术—检测技术与自动化装置] O242.23[理学—计算数学;理学—数学]
  • 作者机构:[1]College of Civil Aviation, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China, [2]Huaiyin Institute of Technology, Huai'an 223003, China
  • 相关基金:supported by the National Natural Science Foundation of China(61079013;61079014;61403198); the National Natural Science Funds and Civil Aviaiton Mutual Funds(U1533128;U1233114); the Programs of Natural Science Foundation of China and China Civil Aviation Joint Fund(60939003); the Natural Science Foundation of Jiangsu Province in China(BK2011737)
中文摘要:

It is significant to combine multiple tasks into an optimal work package in decision-making of aircraft maintenance to reduce cost,so a cost rate model of combinatorial maintenance is an urgent need.However,the optimal combination under various constraints not only involves numerical calculations but also is an NP-hard combinatorial problem.To solve the problem,an adaptive genetic algorithm based on cluster search,which is divided into two phases,is put forward.In the first phase,according to the density,all individuals can be homogeneously scattered over the whole solution space through crossover and mutation and better individuals are collected as candidate cluster centres.In the second phase,the search is confined to the neighbourhood of some selected possible solutions to accurately solve with cluster radius decreasing slowly,meanwhile all clusters continuously move to better regions until all the peaks in the question space is searched.This algorithm can efficiently solve the combination problem.Taking the optimization on decision-making of aircraft maintenance by the algorithm for an example,maintenance which combines multiple parts or tasks can significantly enhance economic benefit when the halt cost is rather high.

英文摘要:

It is significant to combine multiple tasks into an optimal work package in decision-making of aircraft maintenance to reduce cost,so a cost rate model of combinatorial maintenance is an urgent need.However,the optimal combination under various constraints not only involves numerical calculations but also is an NP-hard combinatorial problem.To solve the problem,an adaptive genetic algorithm based on cluster search,which is divided into two phases,is put forward.In the first phase,according to the density,all individuals can be homogeneously scattered over the whole solution space through crossover and mutation and better individuals are collected as candidate cluster centres.In the second phase,the search is confined to the neighbourhood of some selected possible solutions to accurately solve with cluster radius decreasing slowly,meanwhile all clusters continuously move to better regions until all the peaks in the question space is searched.This algorithm can efficiently solve the combination problem.Taking the optimization on decision-making of aircraft maintenance by the algorithm for an example,maintenance which combines multiple parts or tasks can significantly enhance economic benefit when the halt cost is rather high.

同期刊论文项目
同项目期刊论文
期刊信息
  • 《系统工程与电子技术:英文版》
  • 主管单位:中国航天机电集团
  • 主办单位:中国航天工业总公司二院
  • 主编:高淑霞
  • 地址:北京海淀区永定路52号
  • 邮编:100854
  • 邮箱:jseeoffice@126.com
  • 电话:010-68388406 68386014
  • 国际标准刊号:ISSN:1004-4132
  • 国内统一刊号:ISSN:11-3018/N
  • 邮发代号:82-270
  • 获奖情况:
  • 航天系统优秀期刊奖,美国工程索引(EI)和英国科学文摘(SA)收录
  • 国内外数据库收录:
  • 荷兰文摘与引文数据库,美国工程索引,美国剑桥科学文摘,美国科学引文索引(扩展库),英国科学文摘数据库
  • 被引量:242