Competitive approaches to PSO algorithms via new acceleration co-efficient variant with mutation operators

Arumugam, , MS and Rao, , MVC and Chandramohan, , A (2005) Competitive approaches to PSO algorithms via new acceleration co-efficient variant with mutation operators. ICCIMA 2005: Sixth International Conference on Computational Intelligence and Multimedia Applications, Proceedings. pp. 225-230.

Full text not available from this repository.

Abstract

This paper presents a few new competitive approaches to particle swarm optimization (PSO) algorithm in terms of the global and local best values (GLbest-PSO) and the standard PSO along with three set of variants namely, inertia weight (IW) acceleration co-efflicient (AC) and mutation operators in this paper. Standard PSO is designed with time varying FF inertia weight (TVIW) and either time varying AC (TVAC) or fixed AC (FAC) while GLbest-PSO comprises of Global-average Local best IW (GaLbestIW) with either Global-Local best AC (GLbestAC) or FAC. The performances of these two algorithms are improved considerably in solving an optimal control problem, by introducing the concept of mutation variants between particles in each generation. The presence of mutation operator sharpens the convergence and tunes to the best solution. In order to compare and verify the validity and effectiveness of the new approaches for PSO, several statistical analyses are carried out. The results clearly demonstrate the improved performances of the proposed PSOs over the standard PSOs.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Engineering and Technology (FET)
Depositing User: Ms Rosnani Abd Wahab
Date Deposited: 23 Aug 2011 00:44
Last Modified: 23 Aug 2011 00:44
URI: http://shdl.mmu.edu.my/id/eprint/2375

Actions (login required)

View Item View Item