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 optima...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.展开更多
A simplified group search optimizer algorithm denoted as"SGSO"for large scale global optimization is presented in this paper to obtain a simple algorithm with superior performance on high-dimensional problem...A simplified group search optimizer algorithm denoted as"SGSO"for large scale global optimization is presented in this paper to obtain a simple algorithm with superior performance on high-dimensional problems.The SGSO adopts an improved sharing strategy which shares information of not only the best member but also the other good members,and uses a simpler search method instead of searching by the head angle.Furthermore,the SGSO increases the percentage of scroungers to accelerate convergence speed.Compared with genetic algorithm(GA),particle swarm optimizer(PSO)and group search optimizer(GSO),SGSO is tested on seven benchmark functions with dimensions 30,100,500 and 1 000.It can be concluded that the SGSO has a remarkably superior performance to GA,PSO and GSO for large scale global optimization.展开更多
基金supported by the National Natural Science Foundation of China(6107901361079014+4 种基金61403198)the National Natural Science Funds and Civil Aviaiton Mutual Funds(U1533128U1233114)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.
基金the Science and Technology Planning Project of Hunan Province(No.2011TP4016-3)the Construct Program of the Key Discipline(Technology of Computer Application)in Xiangnan University
文摘A simplified group search optimizer algorithm denoted as"SGSO"for large scale global optimization is presented in this paper to obtain a simple algorithm with superior performance on high-dimensional problems.The SGSO adopts an improved sharing strategy which shares information of not only the best member but also the other good members,and uses a simpler search method instead of searching by the head angle.Furthermore,the SGSO increases the percentage of scroungers to accelerate convergence speed.Compared with genetic algorithm(GA),particle swarm optimizer(PSO)and group search optimizer(GSO),SGSO is tested on seven benchmark functions with dimensions 30,100,500 and 1 000.It can be concluded that the SGSO has a remarkably superior performance to GA,PSO and GSO for large scale global optimization.
