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,...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2010
|
| Subjects: | |
| 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!
|
| Summary: | 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. |
|---|