Improved genetic algorithm for voltage security constrained optimal power flow problem
by D. Devaraj, J. Preetha Roselyn
International Journal of Energy Technology and Policy (IJETP), Vol. 5, No. 4, 2007

Abstract: Voltage stability has become an important issue in the planning and operation of many power systems. Contingencies such as unexpected line outages in a stressed system may often result in voltage instability which may lead to voltage collapse. This paper presents a Genetic Algorithm (GA) approach for solving the Voltage Security Constrained Optimal Power Flow (VSC-OPF) problem. Base-case generator power output, voltage magnitude of generator buses, transformer tap position and reactive power generation of capacitor banks are taken as the control variables. Maximum L-index of load buses is used to specify the voltage stability level of the system. An improved GA which permits the control variables to be represented in their natural form is proposed to solve this combinatorial optimisation problem. For effective genetic operation, crossover and mutation operators which can directly operate on floating point numbers and integers are used. The proposed approach has been evaluated on the IEEE 30-bus test system. Simulation results show the effectiveness of the proposed approach for improving the voltage security of the system.

Online publication date: Wed, 15-Aug-2007

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 Energy Technology and Policy (IJETP):
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