简介:Itissignificanttocombinemultipletasksintoanoptimalworkpackageindecision-makingofaircraftmaintenancetoreducecost,soacostratemodelofcombinatorialmaintenanceisanurgentneed.However,theoptimalcombinationundervariousconstraintsnotonlyinvolvesnumericalcalculationsbutalsoisanNP-hardcombinatorialproblem.Tosolvetheproblem,anadaptivegeneticalgorithmbasedonclustersearch,whichisdividedintotwophases,isputforward.Inthefirstphase,accordingtothedensity,allindividualscanbehomogeneouslyscatteredoverthewholesolutionspacethroughcrossoverandmutationandbetterindividualsarecollectedascandidateclustercentres.Inthesecondphase,thesearchisconfinedtotheneighbourhoodofsomeselectedpossiblesolutionstoaccuratelysolvewithclusterradiusdecreasingslowly,meanwhileallclusterscontinuouslymovetobetterregionsuntilallthepeaksinthequestionspaceissearched.Thisalgorithmcanefficientlysolvethecombinationproblem.Takingtheoptimizationondecision-makingofaircraftmaintenancebythealgorithmforanexample,maintenancewhichcombinesmultiplepartsortaskscansignificantlyenhanceeconomicbenefitwhenthehaltcostisratherhigh.