Solution to Optimal Power flow by PSO

RM Saloman danaraj EEE Department

Jubail Industrial Collge, Jubail,Kingdom Of Saudi Arabia.
Mail:salorajan@gmail.com
1. Introduction
.
Optimal Power flow(OPF) is allocating loads to plants for minimum cost while meeting

the network constraints. It is formulated as an optimization problem of minimizing the

total fuel cost of all committed plant while meeting the network(power flow ) constraints.

The variants of the problems are numerous which model the objective and the constraints

in different ways.

The basic OPF problem can described mathematically as a minimization of problem of

Minimizing the total fuel cost of all committed plants subject to the constraints.

F( Pi) is the fuel cost equation of the ‘i’th plant. It is the variation of fuel cost ($ or Rs)

with generated power (MW).Normally it is expressed as continuous quadratic equation.

The total generation should meet the total demand and transmission loss. The

transmission loss can be determined from power flow.

2. Solution by PSO Genetic Algorithm

1.Collect the busdata,line data and cost coefficients and their limits.

2. Convert the constrained optimization problem as an unconstrained problem by penalty

function method.



3. This software contain two files psopf.m and opf2.m and pflow.m.opf2.m is a function

file which returns the fuel cost, voltage ,Generation, and transmission loss. Pflow.m is the

power flow routine The ieee 30 bus system is considered for simulation..

4.Change your default folder as opf.Just run psoopf.The results will be displayed on the

command window.

PSO: 1/500 iterations, GBest = 818.52280794588512.

PSO: 20/500 iterations, GBest = 802.9485336571363.
PSO: 40/500 iterations, GBest = 801.84502827715551.
PSO: 60/500 iterations, GBest = 801.84429862527554.
PSO: 80/500 iterations, GBest = 801.84423945948652.
PSO: 100/500 iterations, GBest = 801.84423945948652.
PSO: 120/500 iterations, GBest = 801.84423945948652.
PSO: 140/500 iterations, GBest = 801.84381278052626.
PSO: 160/500 iterations, GBest = 801.84369688225115.
PSO: 180/500 iterations, GBest = 801.84366757483645.
PSO: 200/500 iterations, GBest = 801.84366757483645.
PSO: 220/500 iterations, GBest = 801.84366757483645.
PSO: 240/500 iterations, GBest = 801.84366757483645.
PSO: 260/500 iterations, GBest = 801.84361652746111.
PSO: 280/500 iterations, GBest = 801.84361432503761.
PSO: 300/500 iterations, GBest = 801.84360962771177.
PSO: 320/500 iterations, GBest = 801.84360962771177.
PSO: 340/500 iterations, GBest = 801.8436072032963.
PSO: 360/500 iterations, GBest = 801.84360514484456.
PSO: 380/500 iterations, GBest = 801.84360448001792.
PSO: 400/500 iterations, GBest = 801.84359710531487.
PSO: 420/500 iterations, GBest = 801.84359678791236.
PSO: 440/500 iterations, GBest = 801.84359678056865.
PSO: 460/500 iterations, GBest = 801.84359602650181.
PSO: 480/500 iterations, GBest = 801.84359599520189.
PSO: 500/500 iterations, GBest = 801.84359596776767.

P1 =

48.830710456655801
21.473756009580281
21.645864276661513
12.094377346577968
12.000000000000000

F1 =

8.018435959677677e+002

P=

1.0e+002 *

1.767314254838569 0.488307104566558 0.214737560095803 0.216458642766615

0.120943773465780 0.120000000000000

VV =

Columns 1 through 6

1.060000000000000 1.043000000000000 1.025413783394172 1.017131509026298

1.010000000000000 1.014769664042682

Columns 7 through 12

1.005038164105417 1.010000000000000 1.052965909519290 1.046719608823060

1.082000000000000 1.059937203976502

Columns 13 through 18

1.071000000000000 1.045026686493674 1.040245314359665 1.047141864538727

1.041528634572232 1.030400240859670

Columns 19 through 24
 1.027704952651282 1.031677290240933 1.034456181153072 1.035022169486857
1.029553721518365 1.023697392194044

Columns 25 through 30

1.020347779790547 1.002724681831473 1.026853788152576 1.012841471195776

1.007092030932707 0.995661809041243

TL =

9.376133573332481

ALL THE BEST