摘要
Itissignificanttocombinemultipletasksintoanoptimalworkpackageindecision-makingofaircraftmaintenancetoreducecost,soacostratemodelofcombinatorialmaintenanceisanurgentneed.However,theoptimalcombinationundervariousconstraintsnotonlyinvolvesnumericalcalculationsbutalsoisanNP-hardcombinatorialproblem.Tosolvetheproblem,anadaptivegeneticalgorithmbasedonclustersearch,whichisdividedintotwophases,isputforward.Inthefirstphase,accordingtothedensity,allindividualscanbehomogeneouslyscatteredoverthewholesolutionspacethroughcrossoverandmutationandbetterindividualsarecollectedascandidateclustercentres.Inthesecondphase,thesearchisconfinedtotheneighbourhoodofsomeselectedpossiblesolutionstoaccuratelysolvewithclusterradiusdecreasingslowly,meanwhileallclusterscontinuouslymovetobetterregionsuntilallthepeaksinthequestionspaceissearched.Thisalgorithmcanefficientlysolvethecombinationproblem.Takingtheoptimizationondecision-makingofaircraftmaintenancebythealgorithmforanexample,maintenancewhichcombinesmultiplepartsortaskscansignificantlyenhanceeconomicbenefitwhenthehaltcostisratherhigh.
出版日期
2016年01月11日（中国期刊网平台首次上网日期，不代表论文的发表时间）
