Unit commitment scheduling using binary differential evaluation algorithm

Unit commitment scheduling using binary differential evaluation algorithm

0.00 Avg rating0 Votes
Article ID: iaor200973162
Country: India
Volume: 46
Issue: 1
Start Page Number: 108
End Page Number: 122
Publication Date: Mar 2009
Journal: OPSEARCH
Authors: , ,
Keywords: scheduling, heuristics: genetic algorithms
Abstract:

This paper presents a new approach for thermal generating units scheduling using binary differential evaluation (BDE) algorithm. Solving the unit commitment (UC) problem by BDE is a two stage process.In the first stage, the economic dispatch of the units are solved and hourly optimum solution of UC is obtained considering all constraints except the minimum up time (MUT) and minimum down time (MDT) constraints. In the second stage, the MUT and MDT are enforced by defining a probability function followed by modifying the schedule obtained in the first step. To validate the results obtained by BDE, a version of genetic algorithm (GA), namely as, PNUCO is applied for comparison. Also, the results obtained by BDE and PNUCO are compared with the previous approaches reported in the literature. The results show that the BDE produces optimal or nearly optimal solutions for the study systems.

Reviews

Required fields are marked *. Your email address will not be published.