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:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 语言: | English |
| 出版: |
2015
|
| 主题: | |
| 在线阅读: | https://ir.uitm.edu.my/id/eprint/67280/2/67280.pdf |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
| 总结: | 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. |
|---|