4.7 Article

PSOG: Enhanced particle swarm optimization by a unit vector of first and second order gradient directions

Journal

SWARM AND EVOLUTIONARY COMPUTATION
Volume 46, Issue -, Pages 28-51

Publisher

ELSEVIER
DOI: 10.1016/j.swevo.2019.01.010

Keywords

Enhanced PSO; Gradient directions; Structural optimization; Metaheuristic

Ask authors/readers for more resources

Particle swarm optimization (PSO) is one of the effective metaheuristic optimization methods that has been used in various design problems. As the number of design variables increases for multimodal design space, the efficiency of the approach will decrease. In the present paper, the method of PSO is combined with first and second order gradient directions and the robustness of the approach is greatly increased. Design problems are chosen from the literature and the results are compared with the original PSO. In structural optimization, the number of required analyses of the structure is an important factor in choosing an effective optimization approach. In the combined method, the number of initial particles can be reduced which in turn, the overall cost of the optimization process will be reduced. The new approach is not sensitive to the required optimization scaling parameters and it is stable. In addition, a modified penalty function is introduced with appropriate performance that is employed in the optimization process. To show the superiority of the proposed method, 25 test cases from CEC 2005 with 10 and 30 variables are chosen and the results of 10 PSO variants are compared. Also, 30 functions from CEC 2017 with 10, 30 and 50 variables are chosen for comparison.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Computer Science, Artificial Intelligence

Momentum method powered by swarm approaches for topology optimization

Farzad Salajegheh, Mohammad Kamalodini, Eysa Salajegheh

APPLIED SOFT COMPUTING (2020)

Article Computer Science, Artificial Intelligence

Energy-efficient flexible job shop scheduling problem considering discrete operation sequence flexibility

Guiliang Gong, Jiuqiang Tang, Dan Huang, Qiang Luo, Kaikai Zhu, Ningtao Peng

Summary: This paper proposes a flexible job shop scheduling problem with discrete operation sequence flexibility and designs an improved memetic algorithm to solve it. Experimental results show that the algorithm outperforms other algorithms in terms of performance. The proposed model and algorithm can help production managers obtain optimal scheduling schemes considering operations with or without sequence constraints.

SWARM AND EVOLUTIONARY COMPUTATION (2024)

Article Computer Science, Artificial Intelligence

A differential evolution algorithm for solving mixed-integer nonlinear programming problems

Daniel Molina-Perez, Efren Mezura-Montes, Edgar Alfredo Portilla-Flores, Eduardo Vega-Alvarado, Barbara Calva-Yanez

Summary: This paper presents a new proposal based on two fundamental strategies to improve the performance of the differential evolution algorithm when solving MINLP problems. The proposal considers a set of good fitness-infeasible solutions to explore promising regions and introduces a composite trial vector generation method to enhance combinatorial exploration and convergence capacity.

SWARM AND EVOLUTIONARY COMPUTATION (2024)