Unit Commitment is an important and vital optimization task in a power control centre. After load forecasting it is the second step in the planning process. It consists of two linked optimization problems. It comprises unit ON/OFF scheduling problem and the economic dispatch sub-problem. The ON/OFF scheduling problem is a 0-1 combinatorial problem with equality and inequality constraints, while the economic dispatch sub-problem is a nonlinear constrained optimization problem.Unit commitment is a nonlinear, large scale, combinatorial, constrained optimization problem. The complete unit commitment optimization problem is to minimize the total production cost (TPC) of utility in such a way that the constraints such as load demand, spinning reserve, minimum and maximum power limits of units, minimum up (MUT) and minimum down times (MDT) are satisfied. Therefore, based on the forecasted load demand, preparing proper ON/OFF schedule of generators can result in cost saving for utility. It is much more difficult problem to solve due to its high dimensionality.The main issues in the UCP are complexity (high dimensions) of search space, generation of initial feasible schedules,
Chandra Jagan Mohan Vyza
Dr. V.Chandra Jagan Mohan completed his graduation in the year 2004 in Electrical and Electronics Engineering from Madras University, obtained his masters in the year 2009 in Electrical Power Systems from J.N.T. University, Hyderabad and obtained Ph.D in Power Systems from S.V.University, Tirupati. He is presently working as Associate Professor.
Number of Pages:
LAP LAMBERT Academic Publishing
To develop new techniques for Unit Commitment Problem, Employing Soft Computing Techniques, Soft computing techniques, Clustering
LAW / General