A New Class Of Operations To Accelerate Particle Swarm Optimization Algorithm And A Novel Hybrid Approach For Unit Commitment Problem.

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 cat...

Full description

Saved in:
Bibliographic Details
Main Author: Ting, Tiew On
Format: Thesis
Published: 2004
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-mmu-ep.146
record_format uketd_dc
spelling my-mmu-ep.1462010-02-23T08:10:52Z A New Class Of Operations To Accelerate Particle Swarm Optimization Algorithm And A Novel Hybrid Approach For Unit Commitment Problem. 2004 Ting, Tiew On QA75.5-76.95 Electronic computers. Computer science 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. 2004 Thesis http://shdl.mmu.edu.my/146/ http://vlib.mmu.edu.my/diglib/login/dlusr/login.php masters Multimedia University Research Library
institution Multimedia University
collection MMU Institutional Repository
topic QA75.5-76.95 Electronic computers
Computer science
spellingShingle QA75.5-76.95 Electronic computers
Computer science
Ting, Tiew On
A New Class Of Operations To Accelerate Particle Swarm Optimization Algorithm And A Novel Hybrid Approach For Unit Commitment Problem.
description 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.
format Thesis
qualification_level Master's degree
author Ting, Tiew On
author_facet Ting, Tiew On
author_sort Ting, Tiew On
title A New Class Of Operations To Accelerate Particle Swarm Optimization Algorithm And A Novel Hybrid Approach For Unit Commitment Problem.
title_short A New Class Of Operations To Accelerate Particle Swarm Optimization Algorithm And A Novel Hybrid Approach For Unit Commitment Problem.
title_full A New Class Of Operations To Accelerate Particle Swarm Optimization Algorithm And A Novel Hybrid Approach For Unit Commitment Problem.
title_fullStr A New Class Of Operations To Accelerate Particle Swarm Optimization Algorithm And A Novel Hybrid Approach For Unit Commitment Problem.
title_full_unstemmed A New Class Of Operations To Accelerate Particle Swarm Optimization Algorithm And A Novel Hybrid Approach For Unit Commitment Problem.
title_sort new class of operations to accelerate particle swarm optimization algorithm and a novel hybrid approach for unit commitment problem.
granting_institution Multimedia University
granting_department Research Library
publishDate 2004
_version_ 1747829092915347456