High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Dynamic Programming Based Unit Commitment Methodology

Author(s):

S.Madhusudan , Muthayammal College of Engineering,salem; Dr.C.Nagrajan , Muthayammal College of Engineering,salem

Keywords:

Scheduling algorithm, Networks,

Abstract

In dynamic programming-based power scheduling algorithms, thousands of hourly economic dispatches must be performed to consider every possible unit combination over all the stages of the optimization interval. If the unit commitment problem is constrained to observe a minimum system spinning reserve and an economic dispatch of a combination of units does not comply with this requirement, necessary and sufficient conditions have been established to guarantee that the dispatch of these units will meet the constraint. However, these conditions can only be checked for feasibility after a dispatch is performed. In this paper, we present necessary and sufficient conditions for the feasibility of unit combinations that can be checked off-line. That is, before the start of the unit commitment algorithm, and thus before any economic dispatches are performed, thereby rendering a very efficient unit scheduling algorithm in terms of computer memory and execution time. Moreover, these feasibility conditions are independent of the problem formulation and thus can easily be applied to other unit commitment algorithms. Examples are provided to illustrate the efficiency attainable by the implementation of these conditions.

Other Details

Paper ID: IJSRDV3I30590
Published in: Volume : 3, Issue : 3
Publication Date: 01/06/2015
Page(s): 1243-1246

Article Preview

Download Article