Optimizing combination of aircraft maintenance tasks by adaptive genetic algorithm based on cluster search  

作　　者：Huaiyuan Li Hongfu Zuo Kun Liang Juan Xu Jing Cai Junqiang Liu 

机构地区：[1]College of Civil Aviation,Nanjing University of Aeronautics and Astronautics,Nanjing 211106,China [2]Huaiyin Institute of Technology,Huai'an 223003,China

出　　处：《Journal of Systems Engineering and Electronics》2016年第1期140-156,共17页系统工程与电子技术（英文版）

基　　金：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.

关 键 词：cluster search genetic algorithm combinatorial optimization multi-part maintenance grouping maintenance. 

分 类 号：V267[航空宇航科学与技术—航空宇航制造工程] TP18[自动化与计算机技术—控制理论与控制工程]