A Genetic Algorithm Approach to Solve Unit Commitment Problem

  • parashar A
N/ACitations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

In this a genetic algorithm based approach to resolve the thermal unit commitment (UC). During this approach load demand, the most objective of getting a possible unit combination for every loading condition whereas subjected to a range of constraints. The model during this study contains four-generation units and also the 8-hour daily load demand. The results are compared between the dynamic programming (DP) and genetic algorithm the achieved results prove the effectiveness, and validity of the planned approach to unravel the large-scale UC. In the results indicating comparison of the cost solutions is using the genetic algorithm and the Dynamic Programming. The MATLAB Tool box is used to find the result.

Cite

CITATION STYLE

APA

parashar, A. (2013). A Genetic Algorithm Approach to Solve Unit Commitment Problem. IOSR Journal of Electrical and Electronics Engineering, 7(3), 60–64. https://doi.org/10.9790/1676-0736064

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free