Hybrid PSO6 for Hard Continuous Optimization

Abstract

In our previous works, we empirically showed that a number of 6±2 informants may endow particle swarm optimization (PSO) with an optimized learning procedure in comparison with other combinations of informants. In this way, the new version PSO6, that evolves new particles from six informants (neighbors), performs more accurately that other existing versions of PSO and is able to generate good particles for a longer time. Despite this advantage, PSO6 may show certain attraction to local basins derived from its moderate performance on non-separable complex problems (typically observed in PSO versions). In this paper, we incorporate a local search procedure to the PSO6 with the aim of correcting this disadvantage. We compare the performance of our proposal (PSO6-Mtsls) on a set of 40 benchmark functions against that of other PSO versions, as well as against the best recent proposals in the current state of the art (with and without local search). The results support our conjecture that the (quasi)-optimally informed PSO, hybridized with local search mechanisms, reaches a high rate of success on a large number of complex (non-separable) continuous optimization functions.