.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Meta-heuristic
Particle swarm optimization
Diversity
Memory
Engineering problems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
Cited Papers
.png){kind=icon}
ShareSave
Constraint-handling in genetic algorithms through the use of dominance-based tournament selection
PREAI
ShareSaveShareSaveShareSave
View more