Improved accelerated PSO algorithm for mechanical engineering optimization problems

• Published in: Applied soft computing Vol. 40; pp. 455 - 467
• Main Author: Ben Guedria, Najeh
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.03.2016
• Subjects: Diversity; Engineering problems; Memory; Meta-heuristic; Particle swarm optimization; Engineering problems; Meta-heuristic; Particle swarm optimization; Memory; Diversity
• ISSN: 1568-4946; 1872-9681
• DOI: 10.1016/j.asoc.2015.10.048

Flowchart of the improved accelerated particle swarm optimization. •A new improved accelerated particle swarm optimization algorithm is proposed (IAPSO).•Individual particles memories are incorporated in order to increase swarm diversity.•Balance between exploration and exploitation is controlled through two selected functions.•IAPSO outperforms several recent meta-heuristic algorithms, in terms of accuracy and convergence speed.•New optimal solutions, for some benchmark engineering problems, are obtained. 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.