Super-high Dimension Complex Functions Optimization Using Adaptive Particle Swarm Optimizer
Due to the existence of large numbers of local and global optima of super-high dimension complex functions,general Particle Swarm Optimizer (PSO) methods are slow speed on convergence and easy to be trapped in local optima.In this paper,an Adaptive Particle Swarm Optimizer(APSO) is proposed,which employ an adaptive inertia factor and dynamic changes strategy of search space and velocity in each cycle to plan large-scale space global search and refined local search as a whole according to the fitness change of swarm in optimization process of the functions,and to quicken convergence speed,avoid premature problem,economize computational expenses,and obtain global optimum.We test the proposed algorithm and compare it with other published methods on several super-high dimension complex functions,the experimental results demonstrate that this revised algorithm can rapidly converge at high quality solutions.
Particle Swarm Optimizer (PSO) Complex functions Convergenc premature problem adaptive
Ying Zhang Boqin Liu Hanrong Chen
College of Computer and Information ScienceSouthwest UniversityChongqing.China 400715
国际会议
西安
英文
1830-1835
2012-08-24(万方平台首次上网日期,不代表论文的发表时间)