PSGO: Particle Swarm Gravitation Optimization Algorithm

Abstract

Abstract

Particle swarm optimization (PSO) is the most well known of the swarm-based intelligence algorithms. However, the PSO converges prematurely, which rapidly decreases the population diversity, especially when approaching local optima. To improve the diversity of the PSO, we here propose a memetic algorithm called particle swarm gravitation optimization (PSGO). After a specific number of iterations, some individuals selected from the PSO and GSA systems are exchanged by the roulette wheel approach. Finally, to increase the diversities of the PSO and GSA, we introduce a diversity enhancement operator, which is inspired by the crossover operator used in differential evolution algorithms. In evaluations of five benchmark functions, the PSGO significantly outperformed the PSO and Cuckoo search and yielded a superior performance to the GSA of most of instances and computation times.