Scribd
Upload
17 views

Hybrid Imperialist Competitive Algorithm - A Meta-Heuristic Approach To Solve Security Constrained Optimal Power Flow

This document presents a hybrid imperialist competitive algorithm approach for solving the security constrained optimal power flow (SCOPF) problem. The SCOPF aims to determine an optimal generating pattern that satisfies system constraints and load demand, even during contingencies. The algorithm starts with an initial population of "countries" representing different power flows. Imperialist and colony countries are selected, with empires formed between them. Convergence occurs when weaker empires collapse, leaving the strongest. The approach is tested on the IEEE 30 bus system, showing better optimization than other methods.

Uploaded by

Mani Vannan Soundarapandiyan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
17 views

Hybrid Imperialist Competitive Algorithm - A Meta-Heuristic Approach To Solve Security Constrained Optimal Power Flow

This document presents a hybrid imperialist competitive algorithm approach for solving the security constrained optimal power flow (SCOPF) problem. The SCOPF aims to determine an optimal generating pattern that satisfies system constraints and load demand, even during contingencies. The algorithm starts with an initial population of "countries" representing different power flows. Imperialist and colony countries are selected, with empires formed between them. Convergence occurs when weaker empires collapse, leaving the strongest. The approach is tested on the IEEE 30 bus system, showing better optimization than other methods.

Uploaded by

Mani Vannan Soundarapandiyan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Hybrid Imperialist Competitive Algorithm A MetaHeuristic Approach To Solve Security Constrained

Optimal Power Flow


Keerthana Suganthi.V, Meenakumari.R
Department of Electrical and Electronics Engineering
Kongu Engineering College
Perundurai, Tamilnadu, India
[email protected], [email protected]

Abstract
Optimal power flow (OPF) is an important tool used in the planning and
operation stages of a power system, wherein a certain objective is optimized
subject to specific system constraints. Security constrained optimal power flow
(SCOPF) is an advanced OPF formulation wherein security constraints should
be satisfied in case of contingencies, in addition to the normal system
constraints. Possible contingencies that are likely to occur in the system such as
line outages are considered and for vulnerable cases, SCOPF is solved to
characterize secure operating conditions for the system.

Keywords - optimal power flow; imperialist competitive algorithm; fuel cost


minimization

1. Introduction

Optimal power flow has been a subject of intensive research ever since it was
first proposed by Dommel and Tinney [5]. The OPF problem optimizes an
objective function (such as minimization of fuel cost of thermal generating

units) by optimal adjustment of power system control variables while satisfying


a set of system operating constraints.
Generally OPF is a non-linear, large-scale optimization problem where
the nodal power balance equations form the equality constraints and the limits
on the control and state variables form the inequality constraints [6].

2. Problem Formulation

2.1 OPF Formulation

The most common OPF objective functions are minimization of fuel costs,
minimization of system losses, minimization of control adjustments, etc. The
objective considered in this paper is fuel cost minimization where the total fuel
cost of generating units in a system is given by

NG

2
F ( P Gi) (a i P Gi bi P Gi c i)
i 1

where PGi is the active power output of the ith generating unit.

2.2 Augmented Objective Function

The highly constrained OPF problem can be converted into an unconstrained


optimization problem by enforcing penalty functions [2]. Their general form is
given by
Penalty Function = (x - xlim)2
where denotes the penalty factor which is chosen arbitrarily.

The augmented objective function with the incorporation of penalty functions is


represented by

3. Methodology

The objective of SCOPF problem is to arrive at an optimum generating pattern


consisting of the active power outputs of all the generating units such that the
operation of the system corresponding to that pattern will not violate any system
constraints while simultaneously satisfying the load demand. Imperialist

competitive algorithm (ICA) is an evolutionary programming technique inspired


by imperialistic competition in the geopolitical interactions between countries
[4]. The algorithm starts with an initial population space whose individual
members are called countries. Some countries with minimum cost are chosen
as imperialists and the rest are termed as colonies under those imperialists.
Each imperialist along with its colonies is termed as an empire. Imperialistic
competitions among the different empires form the basis of this algorithm.
Convergence is achieved when the weaker empires collapse and only the
strongest empire remains at the end. In ICA, the power of each country is
inversely proportional to its cost. The flowchart for hybrid ICA is shown in Fig.
1.

Fig 1. Flowchart of Hybrid Imperialistic Competitive Algorithm

4. Test Results

The algorithm parameters are selected as follows :


Number of initial countries = 100

Number of initial imperialists = 5


Revolution rate = 0.3
Assimilation coefficient = 2
= 0.15

The proposed hybrid ICA algorithm is applied to solve the OPF problem and the
results obtained are compared against those obtained by Saini et al [1] using the
genetic algorithm (GA)-fuzzy approach in Table I.
OPF Results for IEEE 30 Bus System
Limits

Generated
Power

GA-Fuzzy

Hybrid
ICA

Min

Max

PG1 (MW)

50

250

174.96

176.3

PG2 (MW)

20

80

50.35

47.8

PG3 (MW)

15

50

21.45

22.1

PG4 (MW)

10

35

21.17

21.7

PG5 (MW)

10

30

12.66

12.6

PG6 (MW)

12

40

12.10

12.0

Cost ($/hr)

802.0003

801.0743

Transmission Loss (MW)

9.29

9.1

5. Conclusion

In this paper, the application of hybrid imperialist competitive algorithm to


solve the security constrained optimal power flow (SCOPF) problem has been
presented. For ease of computing, the highly constrained optimization problem
was converted into an unconstrained one by using penalty function method. The
proposed approach was tested on the IEEE 30 bus system. The OPF and SCOPF
results indicate that the hybrid ICA offers better optimization when compared to
the methods reported in literature. Thus hybrid ICA can provide cost-effective
and secure operating conditions for a power system, thus aiding power system
operators in the decision-making process during the planning and operation of a
power system.

References
1. Ashish Saini, D.K.Chaturvedi, and A.K.Saxena, Optimal power flow
solution : A GA-Fuzzy system approach, International Journal of
Emerging Electric Power Systems, vol. 5, no.1, 2006.
2. M.M.Bhaskar, S.Muthyala and S.Maheswarapu, Security Constrained
Optimal Power Flow (SCOPF) A Comprehensive Survey, International
Journal of Computer Applications, vol. 11, no. 6, pp. 42-52,December
2010.
3. David I.Sun, Bruce Ashley, Brian Brewer, Art Hughes, and William
F.Tinney, Optimal power flow by Newtons approach, IEEE
Transactions on Power Apparatus and Systems, vol. PAS-103, no. 10, pp.
2864-2880, October 1984.
4. Esmaeil Atashpaz-Gargari, and Caro Lucas, Imperialist competitive
algorithm : an algorithm for optimization inspired by imperialistic
competition, IEEE Congress on Evolutionary Computation, pp. 46614667, 2007.

5. Hermann W.Dommel, and William F.Tinney, Optimal power flow


solutions, IEEE Transactions on Power Apparatus and Systems, vol.
PAS-87, no. 10, pp. 1866-1876, October 1968.
6. D.P.Kothari, and J.S.Dhillon, Power System Optimization, Prentice-Hall
of India, 2004.

You might also like