Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Assistant Professor, Electrical and Electronics Engineering, Francis Xavier Engineering College,Tirunelveli,India1
Associate Professor, Electrical and Electronics Engineering, Francis Xavier Engineering College,Tirunelveli,India2
Assistant Professor, Electrical and Electronics Engineering, SCAD Institute of Techonology,Coimbatore,India3
Abstract: An extended stochastic multi-objective model for economic dispatch (ED) is proposed, that incorporates in
the optimization process heat and power from CHP units and expected wind power. Stochastic restrictions for the
CO2, SO2 and NOx emissions are used as inequality constraints. The ED problem is solved using a Genetic
Algorithm. The available wind power is estimated from a transformation of the wind speed considered as a random
variable to wind power.
Keywords: Economic dispatch, Wind power, Optimization, Genetic algorithm
I. INTRODUCTION
(2.1)
CHP units can be expressed as a convex function of 2.3. TOTAL COST FUNCTION
electrical and thermal power output, 0i and Hi, respectively. The total cost function is formulated as
= + + 2 + + 2 + (2.2)
(2.3)
W ( PD ) max W
W ( PD ) max W ( PD ) min
D min
Wmin W Wmax
W W ( PD ) max (2.4)
=1 l the
Where WC =
operating cost of wind power and
WC(PD)min, WC(PD)max the minimum and upper bounds,
expressed in cost. Over the upper bound, the system is
unstable due to wind perturbations. Both values depend on
the total load demand, as well as the system dynamic
security characteristics. Wind power curtailment is penalized
by a cost function of the difference between the wind power
available (Wav) to the wind power dispatched by the
operator.
Cw,l(Wav,l Wl) = kp,l(Wav,l Wl)
(2.5)
J1=
NP
C
i=1 i
C C O H +
h C T xWC
P i + j=1
j
j j
k =1 k k
+WCmax +
Nw
i=1 Cw (Wav
Wi )
(2.6)
=1
=1
2
=1 )
(2.7)
=1
=1
=1
=0
(3.1)
= 1,2, ,
= 1,2, ,
= 1,2, ,
= 1,2, ,
0 ,,
= 1,2, ,
(3.2)
01
where Pmin, Pmax, 0min, 0max are the conventional
thermal and cogeneration units power limits, wr the rated
power of wind turbines and Hmin, Tmin, Hmax, Tmax the
heat production limits of cogeneration units and heat-only
units.
Using the coefficient, the wind power dispatch
estimation during the optimization process must follow
=1
(3.3)
=1
(3.4)
The PSO algorithm is not suited to resolve the multiobjective optimization problem in that no absolute global
optimum exists there, but rather a set of non-dominated
solutions. In this paper Genetic algorithm is adopted to solve
the bi-objective economic dispatch problem
7
V. GENETIC ALGORITHM
5.1 INTRODUCTION
The objective of the genetic algorithm is to find an
optimal solution to a problem. Of course, since genetic
algorithms are heuristics procedures, they are able to find
very good solutions for a wide range of problems. Genetic
algorithms work by evolving a population of individuals
over a number of generations. A fitness value is assigned to
each individual in the population, where the fitness
computation depends on the application. The main
advantages of genetic algorithms are,
1. They are adaptive
2. They have intrinsic parallelism
3. They have intrinsic parallelism
5.2 SEARCH SPACE
If we are solving a problem, we usually are looking
for some solution, which will be the best among others. The
space of all feasible solutions that is the set of solutions
among which the desired solution resides is called Search
Space also called State Space. Each point in the Search
Space represents one possible solution. Each possible
solution can be marked by its value or fitness for problem.
With GAs we look for the best solution among a number of
possible solutions represented by one point in the Search
Space.
Looking for a solution is then equal to looking for some
extreme value minimum or maximum in the search Space.
At times, the Search Space may be well defined, but usually
a few points in the search Space is known. In the processing
of using GA, the process of finding solution generated other
points (possible solutions) as evolution process
5.3 ALGORITHM
Step 1: Initialize a population of chromosomes
Step 2: Evaluate each chromosome in the population
Step 3: Create new chromosomes by current chromosomes
with reproduction, crossover and mutation.
Step 4: Delete members of the population to make room for
the new chromosomes.
Step 5: Evaluate the new chromosomes and insert them into
the population.
Step 6: Repeat 2~5 until the number of loops reaches a
certain amount or satisfied plans are achieved
; if not, go to step3.
Step 1: Initialize a population of chromosomes
The optimization problem is specified as follows
min f ( x) x X
(5.1)
Subject to g ( x ) 0 and h( x ) 0
Wher f(x) is the objective function, g(x) is the inequality
constraint, h(x) is the equality constraint, xi is the set of each
decision variable, X is the set of the possible range of values
for each decision variable ie L xi X i U xi L xi is the
,
lower bound of decision variable and U xi is the upper