Improved Pelican Optimization Algorithm Based on Circle Mapping and Adaptive t-Distribution Mutation
In view of the shortcomings of the traditional pelican optimization algorithm,such as slow convergence speed and easy to fall into local optimal solutions,an improved pelican optimization algorithm based on Circle map initialization and adaptive t-distribution mutation is proposed.First,in the population initialization stage,the Circle mapping is used to generate an initial so-lution with a high degree of diversity,and combined with the reverse learning strategy,the diversity of the population is im-proved and the exploration ability of the population is enhanced.Secondly,in the iterative process,the adaptive t-distribution mutation operation is used to perturb the individual,which helps the pelican optimization algorithm jump out of the local optimal solution and improve the convergence speed.In addition,an adaptive factor and an improved inertia weight are introduced in the exploration stage of the pelican optimization algorithm,which better balances the global exploration ability and local develop-ment ability of the algorithm.Finally,IPOA is compared with other four classical algorithms on several test functions.Experimen-tal results show that IPOA has a significant improvement in convergence speed,global search ability and convergence robustness.
国家科技期刊平台
NSTL
万方数据
