Sequential Hybrid Particle Swarm Optimization and Gravitational Search Algorithm with Dependent Random Coefficients

الملخص EN

Particle swarm optimization (PSO) has been proven to show good performance for solving various optimization problems.

However, it tends to suffer from premature stagnation and loses exploration ability in the later evolution period when solving complex problems.

This paper presents a sequential hybrid particle swarm optimization and gravitational search algorithm with dependent random coefficients called HPSO-GSA, which first incorporates the gravitational search algorithm (GSA) with the PSO by means of a sequential operating mode and then adopts three learning strategies in the hybridization process to overcome the aforementioned problem.

Specifically, the particles in the HPSO-GSA enter into the PSO stage and update their velocities by adopting the dependent random coefficients strategy to enhance the exploration ability.

Then, the GSA is incorporated into the PSO by using fixed iteration interval cycle or adaptive evolution stagnation cycle strategies when the swarm drops into local optimum and fails to improve their fitness.

To evaluate the effectiveness and feasibility of the proposed HPSO-GSA, the simulations were conducted on benchmark test functions.

The results reveal that the HPSO-GSA exhibits superior performance in terms of accuracy, reliability, and efficiency compared to PSO, GSA, and other recently developed hybrid variants.