Citation

Ting , Tiew On (2004) New Class Of Operations To Accelerate Particle Swarm Optimization Algorithm And A Novel Hybrid Approach For Unit Commitment Problem. Masters thesis, Multimedia University.

Full text not available from this repository.

Abstract

An efficient technique in handling a large number of constraints is through the evolutionary computation (EC) method such as a Genetic Algorithms(GAs0, Evolutionary Programming(EP), Evolutionary Strategies(ES) etc. Particle Swarm Optimization is a population based optimization technique under EC category. In this study, the performance of the Particle Swarm Optimization (PSO) algorithm is improved considerably by introducing a new class of operators to manipulate particles in each generation. These operators are chosen from an empirical study and testing of a large number of opeators. From this empirical study, it is found that the performance of the operators differs from each other and varies with the benchmark problems. Among these operators, the best operators are chosen and divided into three categories namely mutation, crossover and variant.

Item Type:	Thesis (Masters)
Subjects:	Q Science > QA Mathematics > QA71-90 Instruments and machines > QA75.5-76.95 Electronic computers. Computer science > QA76.75-76.765 Computer software
Divisions:	Faculty of Engineering and Technology (FET)
Depositing User:	Ms Rosnani Abd Wahab
Date Deposited:	02 Jul 2010 04:20
Last Modified:	02 Jul 2010 04:20
URII:	http://shdl.mmu.edu.my/id/eprint/791

Downloads

Edit (login required)