Solving unit commitment using Shuffled Frog Leaping Algorithm (SFLA) / Fashirul Azmeer Mohd Fadzil

Mohd Fadzil, Fashirul Azmeer (2015) Solving unit commitment using Shuffled Frog Leaping Algorithm (SFLA) / Fashirul Azmeer Mohd Fadzil. Degree thesis, Universiti Teknologi MARA (UiTM).

Abstract

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.

Metadata

Item Type:	Thesis (Degree)
Creators:	Creators Email / ID Num. Mohd Fadzil, Fashirul Azmeer 2012216734
Contributors:	Contribution Name Email / ID Num. Thesis advisor Sheikh Rahimullah, Bibi Norasiqin UNSPECIFIED
Subjects:	Q Science > QA Mathematics > Instruments and machines > Electronic Computers. Computer Science > Algorithms T Technology > TK Electrical engineering. Electronics. Nuclear engineering > Production of electric energy or power. Powerplants. Central stations T Technology > TK Electrical engineering. Electronics. Nuclear engineering > Electric power distribution. Electric power transmission
Divisions:	Universiti Teknologi MARA, Shah Alam > Faculty of Electrical Engineering
Programme:	Bachelor of Electrical Engineering (Hons)
Keywords:	Shuffled frog leaping algorithm, unit commitment, heuristic method
Date:	2015
URI:	https://ir.uitm.edu.my/id/eprint/67280