An Ant Colony Search Algorithm (ACSA) approach for unit commitment problem / Mohamad Masri Mohamad Jaib

This thesis presents an Ant Colony Search Algorithm (ACSA) to solve unit commitment problem. The study involves the development of ACSA algorithm and engine to solve unit commitment issues. Problem formulation of the unit commitment takes into consideration the minimum up and down time constraints,...

Full description

Saved in:

Bibliographic Details
Main Author:	Mohamad Jaib, Mohamad Masri
Format:	Thesis
Language:	English
Published:	2010
Subjects:	Algorithms
Online Access:	https://ir.uitm.edu.my/id/eprint/67335/2/67335.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-uitm-ir.67335
record_format	uketd_dc
spelling	my-uitm-ir.673352023-01-10T02:21:16Z An Ant Colony Search Algorithm (ACSA) approach for unit commitment problem / Mohamad Masri Mohamad Jaib 2010 Mohamad Jaib, Mohamad Masri Algorithms This thesis presents an Ant Colony Search Algorithm (ACSA) to solve unit commitment problem. The study involves the development of ACSA algorithm and engine to solve unit commitment issues. Problem formulation of the unit commitment takes into consideration the minimum up and down time constraints, start up cost and spinning reserve, which is defined as minimization of the total objective function while satisfying the associated constraints. Problem specific operators are proposed for the satisfaction of time dependent constraints. Problem formulation, representation and the simulation results for a three and four units generator-scheduling problem are presented. 2010 Thesis https://ir.uitm.edu.my/id/eprint/67335/ https://ir.uitm.edu.my/id/eprint/67335/2/67335.pdf text en public degree Universiti Teknologi MARA (UiTM) Faculty of Electrical Engineering Sheikh Rahimullah, Bibi Norasiqin
institution	Universiti Teknologi MARA
collection	UiTM Institutional Repository
language	English
advisor	Sheikh Rahimullah, Bibi Norasiqin
topic	Algorithms
spellingShingle	Algorithms Mohamad Jaib, Mohamad Masri An Ant Colony Search Algorithm (ACSA) approach for unit commitment problem / Mohamad Masri Mohamad Jaib
description	This thesis presents an Ant Colony Search Algorithm (ACSA) to solve unit commitment problem. The study involves the development of ACSA algorithm and engine to solve unit commitment issues. Problem formulation of the unit commitment takes into consideration the minimum up and down time constraints, start up cost and spinning reserve, which is defined as minimization of the total objective function while satisfying the associated constraints. Problem specific operators are proposed for the satisfaction of time dependent constraints. Problem formulation, representation and the simulation results for a three and four units generator-scheduling problem are presented.
format	Thesis
qualification_level	Bachelor degree
author	Mohamad Jaib, Mohamad Masri
author_facet	Mohamad Jaib, Mohamad Masri
author_sort	Mohamad Jaib, Mohamad Masri
title	An Ant Colony Search Algorithm (ACSA) approach for unit commitment problem / Mohamad Masri Mohamad Jaib
title_short	An Ant Colony Search Algorithm (ACSA) approach for unit commitment problem / Mohamad Masri Mohamad Jaib
title_full	An Ant Colony Search Algorithm (ACSA) approach for unit commitment problem / Mohamad Masri Mohamad Jaib
title_fullStr	An Ant Colony Search Algorithm (ACSA) approach for unit commitment problem / Mohamad Masri Mohamad Jaib
title_full_unstemmed	An Ant Colony Search Algorithm (ACSA) approach for unit commitment problem / Mohamad Masri Mohamad Jaib
title_sort	ant colony search algorithm (acsa) approach for unit commitment problem / mohamad masri mohamad jaib
granting_institution	Universiti Teknologi MARA (UiTM)
granting_department	Faculty of Electrical Engineering
publishDate	2010
url	https://ir.uitm.edu.my/id/eprint/67335/2/67335.pdf
_version_	1783735683857252352

An Ant Colony Search Algorithm (ACSA) approach for unit commitment problem / Mohamad Masri Mohamad Jaib

Similar Items