复杂优化问题中小生境粒子群优化算法的改进与-研究.pdfVIP

Abstract Abstract t11ereal numberof callbe Nowadays，insocie够，ala唱e pmcticalproblems whichisneededtobe is treatedasoptimizationproblem．Theproblem optimized consistsof dimension， mainly multi-modal，high complexity alwayscomplex．The is1imited by ectiveor ev01utiona叫algoIIithm multi．obi dynamic，etc．The仃aditional whichresultsinlow and s仃ucture conVergenceprecision， itsoWnmechallismsingle into10cal of t0initial capacityhandling falling optimum，bad sensitivityvalue，easy of problems． high-dimensionalcornplex pmblems was EberhartaIld P础icleswaHn algoritllInproposedby Kennedy optimization which in in1995．Itisa algoritllmoriginated typicalsw锄intelligenceoptimization behaVior．Becauseof也e of mef；ish髓dbirdnock outstaIldingadVantages fora西ng flastsearch search swa．旺n suchas speed，goodglobal algorithm particle optimization swaHn hasbecomethe and