Академический Документы
Профессиональный Документы
Культура Документы
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 198
Abstract—This paper presents a new and efficient method for solving the dynamic economic dispatch (DED) problem. The
main goal of this problem consists in finding the optimal combination of power outputs over a certain period of time while
satisfying all system equality and inequality constraints. The proposed framework is based on a new Genetic Algorithm with
meiosis-specific features that provides efficient global and local search characteristics. The feasibility and the validity of the
proposed approach are evaluated through numerical simulation considering a five-generator system and the results are
compared with the solutions obtained from the literature. The simulation results reveal the superiority of the proposed technique
in solving the DED problem.
Index Terms—Dynamic Economic Dispatch (DED), Genetic Algorithm, total generation cost, constrained optimization.
—————————— ——————————
1 INTRODUCTION
In power system operation, the expected load must be practical limitations are taken into consideration.
predicted following daily, weekly and seasonal cycles and The traditional ED problem is a static optimization
consequently load increase or decrease in each generating problem which attempts to minimize the cost of supply-
unit is required. To achieve this, optimum schedules of ing power subject to constraints on static behavior of the
the generation units must be determined. Due to the generating units. Static economic dispatch is suitable for
complexity of the planning process, the scheduling prob- only one period time-interval, while for multi-time inter-
lem can be decomposed into different time horizons: val it will be difficult to meet the demand.
- Short-term scheduling: with a planning period of 1 day Dynamic economic dispatch (DED) problem is an ex-
to 1 week and a time increment of one hour; tension of the static economic dispatch problem in which
- Medium term scheduling: when the planning horizon is the ramp rate limits of the generators are taken into con-
up to one year; sideration. Adjusting the power output of generators in
- Long-term scheduling: with a time horizon of 1-3 year. order to balance the load variations can minimize system
Short-term generation scheduling consists of determin- losses at all time and it is a fundamental function in pow-
ing startup (which and when generating units should be er system operation.
committed) and the generation levels for each of the In the DED problem one usually divides the dispatch
committed unit over a period of one day to one week. horizon into a number of small time intervals over which
This centralized resource scheduling problem involves in the load is assumed to be constant and the system is con-
fact two distinct tasks: the unit commitment problem and sidered to be in temporal steady-state. Therefore, the
the dispatch strategy. number of decision variables will be the number of gene-
The unit commitment (UC) decision determines which rating units multiplied by the number of time intervals.
of the available units will be turned on in each time pe- Thus, for N units and T time intervals results a complex
riod, taking into account a wide variety of parameters optimization problem of size N*T. Its dynamic nature
and technological aspects, while satisfying constraints (large variation of load demand) and large dimensionality
involved in the operation of the unit (start-up and shut makes this problem a large-scale dynamic optimization
down costs, minimal operation point, etc.). problem, difficult to solve with conventional methods.
Economic Dispatch (ED) is one of the most important
functions of the energy management systems. The main
2 THE DYNAMIC ECONOMIC DISPATCH:
goal of ED of electric power generation consists in finding
the optimal combination of power outputs while satisfy- PROBLEM FORMULATION
ing all system equality and inequality constraints. Al- Input-output characteristics of power generation units
though the basic objective is straightforward, the problem are the most important initial data for solving the prob-
is extended in many ways when valve-point loading ef- lem of optimal planning and operation of power plants.
fects, prohibited operating zones, fuel switching, active or The widely used input-output characteristic of the ith ge-
reactive load, ramp limits of the generators and other nerating unit is a quadratic function, as in [1]:
Thus, the FCC for the unit i can be written in the form
of a quadratic polynomial similar to the heat input equa-
3 EVOLUTIONARY COMPUTATION IN DED
tion: PROBLEM
FCC(PGi)=aiPGi2+biPGi+ci..........UM/h (3) Evolutionary computation comprises a set of tech-
niques (genetic algorithms, genetic programming, evolu-
A common situation is that in which the generating tionary programming and evolutionary strategies)
units have multiple valves that are used to control the inspired by the evolutionary processes which can be
power output of the units. Valve point effects are usually observed in nature: reproduction, mutation,
modeled by adding a sinusoid component to the basic recombination, natural selection and survival of the
quadratic fuel-cost characteristics: fittest. Unlike conventional optimization methods, an
evolutionary algorithm operates on a population apply-
FCC(PGi)=aiPGi2+biPGi+ci+|disin(ei(PGimin-PGi))| (4) ing, over the generations, the principles of natural selec-
tion and “survival of the fittest” to produce better solu-
where ei and fi are the constants for the valve point load- tion. So it uses in the search process an entire population
ing effect of unit i and PGimin is the minimum limit of the – possible solutions to the problem - and not just one
generating output of the ith unit. If there are N generators point in the search space. The algorithm performs specific
committed to the system and T intervals in the scheduled operations within a process of reproduction generated by
period, then the DED problem can therefore be stated as: specific operators that are metaphorically linked with
their biological correspondents: mutation, crossover, in-
T N version [3]. The qualities of each individual are evaluated
Minimize F= FCC ( P t
Gi ) (5) by means of special evaluation function (fitness function).
t 1 i 1 The new population (new solutions) selected on the basis
of fitness function, which replaces the previous genera-
the total generation cost subject to given constraints: tion, bound for optimal and provides the best solutions
for the given issue (Fig. 1):
t
1
,
.
.
.
,
T
N
(i) P
i 1
t
Gi PDt PLoss
t
, (6)
max(PGimin, PGit-1-DRi)≤ PGit ≤min(PGimax, PGit-1+URi) (9) Pkgen =[( PG11,..., PGn1),...,( PG1T,..., PGnT)] (11)
GMAX is the maximum number of generations (first we set duction, thereby ensuring that chromosome number does
GMAX=1000). not double with each generation. Before meiosis, each
In the initial population the output of (N-1) units can chromosome is replicated, forming two sisters "chroma-
be chosen arbitrary within their respective generating tids" that remain linked together. The two sister chroma-
capacity constraints. The reference unit k (randomly se- tids forming each homolog are then separated during the
lected) is constrained by the system power equation bal- second meiotic division. The implemented crossover is
ance, as in [4]. Thus, the dependent generation power PGkt arithmetic crossover. The probability of crossover is pc, so
is computed from (6) as: that an average of pc x 100% chromosomes undergoes
crossover. Fertilization (putting together two gametes
N resulted from meiosis) is done by randomly combining
PGkt = PDt + PLosst - P t
Gi , t=1,...,T (12) gametes from the gene pool: two of the gametes from the
i 1 four that have been formed are then selected randomly to
ik
form two new offsprings. The scheme of the designed GA
for the DED problem is given below:
The total operating cost for each chromosome is com- begin
puted using (5). The reference unit limit constraint is ap- t:= 0;
plied using a penalty factor that is proportional to the initialize population P(0) randomly;
violation and is zero in case of no violation. evaluate P(0)
At first, PGimin and PGimax are redefined: while t ≤Gmax
//roulette wheel selection
PGimin(t)= max(PGimin, PGit-1 -DRi ) (13) for all member of population
PGimax(t)= min(PGimax , PGit-1 +URi) r:=random[0,1]; k:=0; partial_sum:=0
min( t )
PGimin = max PGi (14) repeat
t 1,T
k:=k+1;
PGimax = min PGimax(t ) , i=1,...,N partial_sum:=partial_sum +fitness(k);
t 1,T until(r< partial _ sum or new population is full)
Then, the reference unit constraint penalty is calcu- fitness(k )
lated, as in [4]: k
select_individual:=k
(1-PGk/ PGkmin)Fmax, if PGk < PGkmin repeat
PT= (PGk/ PGkmax -1)Fmax, if PGk >PGkmax (15) //meiosis
0, else for all member of population
T N //replicate_ chromosome1
Where: Fmax FCC ( PGimax ) chromatid1:=chromosome1;
t 1 i 1 chromatid2:=chromatid1
//replicate_ chromosome2
One can observe that for the rest of the (N-1) units, the chromatid3:=chromosome2;
constraint (9) is automatically satisfied. The resulted chromatid4 :=chromatid3
augmented cost function for each individual is: //forming gamete1, gamete2
// crossover(chromatid1, chromatid3)
FT = F+PT (16) r:=random(0,1)
gamete1:=r*chromatid1+(1-r)*chromatid3
Because GA is designed for the solution of a minimiza- gamete2:= (1-r)*chromatid1+r*chromatid3
tion problem, the fitness function is calculated as the in- //forming gamete3, gamete4
verse of the function FT : //crossover(chromatid2, chromatid4)
r:=random(0,1)
fitness = 1/ FT (17) gamete3:=r*chromatid2+(1-r)*chromatid4
gamete4:= (1-r)*chromatid2+r*chromatid4
Once the individuals of current population are eva- //fertilization
luated according to their fitness, the individuals that will generate from gametes by randomly selection:
be the parents of the next generation are selected accord- offspring1 ; offspring2
ing to the desired selection scheme. This study uses the //non-uniform mutation
proportional (roulette wheel) selection. Next, the selected i:=random{1,2,…,N}; randi:=random[0,1]
individuals are paired off randomly to give rise to new if (pmut > randi)
offsprings. The reproduction of the individuals in this offspring1[i] offspring1mut[i]
study is inspired by the organic mechanism of a meiotic offspring2[i] offspring2mut[i]
cell division. In this context, the term "meiosis" refers to endif
the process whereby a nucleus divides by two divisions repeat
(meiosis I and meiosis II) into four gametes. Meiosis evaluate P(t+1)
halves the number of chromosomes before sexual repro- repeat; end.
JOURNAL OF COMPUTING, VOLUME 3, ISSUE 4, APRIL 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 201
45
40
35
30
P(MW)
25
20
Fig. 3. Total fuel cost for different population size
15
10
5
Maintaining the obtained population of 50, the cros-
Schedule from reference schedule from the proposed approach
0 sover rate was changed from 0.5 to 0.9 with an increment
1 2 3 4 5 6 7 8 9 10 11 12 13
hour (h)
14 15 16 17 18 19 20 21 22 23 24
of 0.01 and 50 independent tests were performed for each
case. The obtained results are shown in Fig. 4. The best
Unit 1 schedulng
140 option for crossover rate is located very close to 0.8. After
120 this value, the performance decreases with the increase in
100 crossover rate.
P(MW)
80
60
40
20
schedule from reference schedule from the proposed approach
0
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
hour (h)
Unit 2 scheduling
TABLE 5
PERFORMANCES OF THE PROPOSED ALGORITHM