Solving unit commitment using Shuffled Frog Leaping Algorithm (SFLA) / Fashirul Azmeer Mohd Fadzil
This thesis presents a solution to Unit Commitment (UC) problem of generating units based on Shuffled Frog Leaping Algorithm (SFLA). The proposed SFLA in this study is developed using Matlab programming. This method is applied to the IEEE 30 bus with 6 units system for one day scheduling period. The...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2015
|
| Subjects: | |
| Online Access: | https://ir.uitm.edu.my/id/eprint/67280/2/67280.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This thesis presents a solution to Unit Commitment (UC) problem of generating units based on Shuffled Frog Leaping Algorithm (SFLA). The proposed SFLA in this study is developed using Matlab programming. This method is applied to the IEEE 30 bus with 6 units system for one day scheduling period. The simulation results obtained using the proposed algorithm show that the minimum cost can be obtained for the schedule. |
|---|