An improved genetic algorithm approach for security constrained optimal power flow with corrective action
by D. Devaraj; R. Narmatha Banu
International Journal of Power and Energy Conversion (IJPEC), Vol. 4, No. 4, 2013

Abstract: Security constrained optimal power flow (SCOPF) is a special type of optimal power flow (OPF) programme in which the optimum value of the objective function is computed while satisfying the constraints, both under normal and contingency conditions. This paper presents an improved genetic algorithm (IGA) approach to solve the corrective SCOPF problem which takes into account the system corrective capabilities in the post contingency state. The resulting schedule will have the same security level as the SCOPF, but with lower operating costs. The IGA uses strings of integers and floating point numbers to represent candidate solutions instead of binary strings. Crossover and mutation operators which can directly deal with the floating point number are used for a more effective genetic operation. Computer simulation is carried out on IEEE 30-bus and IEEE 118-bus systems using the proposed approach and the results are compared with the other approaches. Simulation results show the superiority of the proposed approach over the other approaches in solving the SCOPF problem.

Online publication date: Mon, 31-Mar-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Power and Energy Conversion (IJPEC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com