TY - JOUR
AU - A. Bukhari, S. B.
AU - Ahmed, A.
AU - Raza, S. A.
PY - 2020/06/16
Y2 - 2024/07/22
TI - A Review of Application of Genetic Algorithm in Solving Unit Commitment Problem
JF - The Nucleus
JA - The Nucleus
VL - 51
IS - 3
SE - Articles
DO -
UR - http://thenucleuspak.org.pk/index.php/Nucleus/article/view/688
SP - 335-343
AB - Unit commitment (UC) is a non-linear, combinatorial, mixed integer constrained optimization problem. The aim of unit commitment problem (UCP) is obtained the most cost effective on/off schedule for generating units to meet the forecasted load demand and spinning reserve for a specified time horizon. UCP can be seen as a two combined optimization problem, the on/off scheduling problem of generating units and the real power allocation problem. A feasible UC schedule must satisfy various system and unit constraints. Various techniques have been developed to solve generator scheduling problem/ UCP. Natural Evolution based techniques are extensively applied to obtain global optimal solution. Genetic algorithm is one of the evolutionary method. This paper presents a comprehensive review on genetic algorithm based unit commitment problem solution. A survey of all of the research papers up to the year 2013 on this topic is given.
ER -