.png){kind=icon}
返回
Improved accelerated PSO algorithm for mechanical engineering optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2015.10.048.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces an improved accelerated particle swarm optimization algorithm (IAPSO) to solve constrained nonlinear optimization problems with various types of design variables. The main improvements of the original algorithm are the incorporation of the individual particles memories, in order to increase swarm diversity, and the introduction of two selected functions to control balance between exploration and exploitation, during search process. These modifications are used to update particles positions of the swarm. Performance of the proposed algorithm is illustrated through six benchmark mechanical engineering design optimization problems. Comparison of obtained computation results with those of several recent meta-heuristic algorithms shows the superiority of the IAPSO in terms of accuracy and convergence speed. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Meta-heuristic
Particle swarm optimization
Diversity
Memory
Engineering problems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
.png){kind=icon}
Constraint-handling in genetic algorithms through the use of dominance-based tournament selection
PREAI
分享收藏
查看更多内容