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