Home Author Index Search Volume 1 May 2009 ISSN 1797-9617

International Journal of

Recent Trends in Engineering

Home > Vol. 1, No. 3

 

International Journal of Recent Trends in Engineering (IJRTE)

ISSN 1797-9617

Volume 1, Number 3, May 2009

Issue on Electrical & Electronics

Page(s): 106-114

Security Constrained UCP with Operational and Power Flow Constraints

S. Prabhakar karthikeyan, K.Palanisamy, I. Jacob Raglend and D. P. Kothari

Full text: PDF

Abstract

An algorithm to solve security constrained unit commitment problem (UCP) with both operational and power flow constraints (PFC) have been proposed to plan a secure and economical hourly generation schedule. This proposed algorithm introduces an efficient unit commitment (UC) approach with PFC that obtains the minimum system operating cost satisfying both unit and network constraints when contingencies are included. In the proposed model repeated optimal power flow for the satisfactory unit combinations for every line removal under given study period has been carried out to obtain UC solutions with both unit and network constraints. The system load demand patterns have been obtained for the test case systems taking into account of the hourly load variations at the load buses by adding Gaussian random noises. In this paper, the proposed algorithm has been applied to obtain UC solutions for IEEE 30, 118 buses and Indian utility practical systems scheduled for 24 hours. The algorithm and simulation are carried through Matlab software and the results obtained are quite encouraging.

Index Terms

Unit commitment, Dynamic Programming, Newton Raphson, Lagrangian multiplier, Economic dispatch, optimal power flow, Contingency Analysis

Published by Academy Publisher in cooperation with the ACEEE

@ Copyright 2009 ACADEMY PUBLISHER All rights reserved