摘要
本文给出构造了一种根据适度聚度和空间位置聚度自适应动态调整的惯性权重,并在算法中对全局最优解进行变异。数值实验证明改进后的粒子群算法的性能优于带线性递减权重的粒子群算法。
The paper constructs an adaptive inertia weight by fitness value aggregation degree and space position aggregation degree so as to produce dynamically changing inertia weight,at the same takes mutation strategy to global optimization.It is shown by tested with well-known benchmark functions that improved algorithm is better than PSO algorithms with linearly decreasing weight.
作者
段玉红
DUAN Yu-hong(Ningxia University,School of Mathematics and Statistics,Yinchuan Ningxia750021,China)
出处
《科技视界》
2018年第31期76-77,共2页
Science & Technology Vision
基金
宁夏自然科学基金项目:改进的粒子群优化算法及其应用研究(NZ15056)
关键词
粒子群优化算法
惯性权重
变异
Particle swarm optimization algorithm
Inertia weight
Mutation