Open Access
Subscription or Fee Access
A Hybrid Multi-swarm Co-evolutional Particle Swarm Optimizer
Ying Li, Jiaxi Liang
Abstract
In this paper, a novel cooperative particle swarm optimization (CPSO) algorithm which embodies two particle swarms is proposed to alleviate the premature convergence problem of PSO algorithm. The underlying idea of this approach is to utilize random mutation, multi-swarms, and the hybrid of many heuristic optimization methods. Firstly, an improved PSO is proposed, which adopts a new learning scheme and a random mutation operator. Then, the two swarms execute IPSO independently to maintain the diversity of populations, after a certain iteration intervals, extremal optimization (EO) and simulated annealing (SA) are introduced to the two swarms separately. By cooperative exchanging information and the hybrid of global exploration ability of PSO, local exploitation of EO and the statistical promise to deliver a globally optimal solution of SA, the performance of the traditional PSO with single swarm is improved. Simulations on a suite of benchmark functions clear demonstrate the superior performance of the proposed algorithm in terms of solution quality, convergence time.
Keywords
invariance, optimal control, symmetry transformations, Noether’s theorem.
Full Text:
PDF
Refbacks
- There are currently no refbacks.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.