Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Elsevier
105
(Received October 21, 1992; accepted in revised form May 17, 1993)
Summary
In this paper a novel approach to the optimization of large windfarms is presented. The
wind turbine distribution at a given site is optimized in order to extract the maximum energy
for the minimum installation costs. The optimization is made by associating a windfarm
simulation model based on wake superposition with a genetic search code. The purpose of the
paper is to prove the feasibility of the method by analyzing the results obtained in some
simple applications. As a test case, a square site subdivided into 100 square cells as possible
turbine locations has been taken, and the optimization is applied to the number and position
of the turbines for three wind cases: single direction, constant intensity with variable
direction, and variable intensity with variable direction.
1. I n t r o d u c t i o n
W i n d t u r b i n e s for p r o d u c i n g e l e c t r i c a l e n e r g y n o w a d a y s a r e m a t u r e in
t e c h n o l o g y . W h e r e l a r g e wind r e s o u r c e s exist, wind e n e r g y c o n v e r t e r s a r e e v e n
b e c o m i n g e c o n o m i c a l l y c o m p e t i t i v e c o m p a r e d to e l e c t r i c a l p o w e r p r o d u c e d by
o t h e r c o n v e n t i o n a l m e a n s . H o w e v e r , for m u l t i - m e g a w a t t p r o d u c t i o n , a l a r g e
n u m b e r of wind t u r b i n e s m u s t be installed, a n d t h e efficiency of t h e w i n d f a r m is
h i g h l y influenced b y t h e i r p o s i t i o n i n g . T h e p r e s e n t w o r k discusses a n o v e l
a p p r o a c h to t h e w i n d t u r b i n e p o s i t i o n i n g problem. T h e m e t h o d a d o p t e d is
b a s e d on t h e p r i n c i p l e s of g e n e t i c s a n d n a t u r a l e v o l u t i o n , t h a t m a k e s t h e
o p t i m i z a t i o n p r o c e d u r e i n d e p e n d e n t of local o p t i m a or f u n c t i o n g r a d i e n t s .
T h e o p t i m i z a t i o n p r o b l e m of t h e w i n d t u r b i n e d i s t r i b u t i o n a t a g i v e n site
m u s t c o n s i d e r the following s t a t e m e n t s :
- t h e w i n d t u r b i n e s influence e a c h other,
106
2.
Windfarm
modelling
(1)
CT = 4a(1 -- a),
/1-a
r l = rr _ ] :---~-
~] l - - z a
(2)
107
~dary
Mi I ~
--I
Mi+l
(3)
where Zo is the surface roughness of the site and z is the hub height of the wind
turbine. Assuming t h a t the kinetic energy deficit of a mixed wake is equal to
the sum of the energy deficits, the resulting velocity downstream of n turbines
can be calculated using the following expression:
1----
Uo/
i= 1
(4)
Uo/
The thrust coefficient and the electrical power produced by a single turbine are
given as a function of the local wind speed. The wind characteristics are given
by the three parameters direction, intensity, and probability (i.e. time/year
t h a t a particular wind exists), while the turbine characteristics considered
are rotor diameter, hub height, and thrust coefficient and electrical power
extracted as a function of the wind speed.
In order to optimize the windfarm from the economical point of view, it is
necessary to model the cost. In the present example, a simple model is used that
considers only the number of turbines as relevant variable to determine the
cost/year of the windfarm.
We assume t h a t the non-dimensionalized cost/year of a single turbine is
1 and t h a t a maximum cost reduction of 1/3 can be obtained for each turbine if
a large number of machines are installed. We then assume t h a t the total
108
(5)
"/')tot
(6)
where Ptot is the total energy produced in one year, Nt is the number of
turbines, wl and w2 are arbitrarily chosen weights, and costtot is the cost/year
of the whole windfarm. In the following examples wl has been kept small, since
we are looking more for the lowest cost per energy produced.
3. Optimization algorithm
Typical optimization problems are usually solved by means of a "hill
climbing procedure" based mainly on local gradients of a stated "cost function". However, a typical drawback of this approach is the risk of finding only
a local optimum, and the impossibility of finding a global optimum starting
from the same configuration, if the configuration space is not simply connected. The windfarm positioning problem is a typical discrete problem that,
similar to the travelling salesman problem, is impossible to solve exactly, and
where a simple gradient-based method cannot easily be applied. A grid of
10 x 10 possible windturbine locations, even if for each grid point consideration
is restricted only to the two possibilities of having or not having a turbine at
each location, means 21 possibilities to explore, which far exceeds the capability of any existing computer. A genetic search algorithm, developed first by
Holland [4], can be applied to this case in a straightforward way. In what
follows only a brief summary of the method will be given, while a more
extensive discussion on the subject can be found in Ref. [5].
The basic idea of the method is the one of the biological evolution through
simple transformation of a coded configuration. As in the natural process of
reproduction, the genetic information stored in a chromosomal string of two
individuals is used to create the genetic code of a new individual. Evolution
and adaptation of the specie are guaranteed because the best individuals have
the highest probability of surviving and reproducing.
The basic process that can occur in the construction of a new chromosomal
string are random mutation of a gene, an exchange of genetic information
between the reproducing parents and an inversion of the chromosomal string.
In the following we will consider only the first two, namely mutation and
crossover. The choice of the individuals subjected to the reproduction process,
namely crossover and mutation, is randomly made, assigning a probability to
109
=
=
=
=
=
design parameter,
design configuration,
evolution stage of the design,
design quality,
optimality of the design.
110
It must be noted t hat the method in the end looks for a better population and
not directly for the best individual. Therefore, the best solution could even be
found at the early stages of the evolution. However, as the mean fitness of the
population will increase, the fittest individual will probably be part of the most
evolved population.
4. R e s u l t s
In what follows some numerical experiments will be illustrated in order to
demonstrate the capabilities of the method, and not for the solution of a practical optimization problem, and, therefore, some crude assumptions about wind
distribution and turbine characteristics will be made. The optimization of
a windfarm on a square shaped t e r r a i n subdivided into 100 possible turbine
location will be considered under three significant conditions: the case of
a single wind direction and intensity, the case of a constant intensity and 360
variable direction, and the case of a more realistic wind distribution. The
possible turbine location will be the center of a square cell having a side
size equal to five turbine diameters. A 5D cell guarantee the accuracy of the
wake decay model t ha t at a smaller distance could be inappropriate. The total
size of the windfarm site is therefore 50D 50D. All optimization procedures
will start from random configurations even though for practical cases, a better
initialization of the genetic search could sensibly reduce the computation time
required.
Only one wind turbine type has been considered having a h = 6 0 m hub
height, a 40 m diameter, a thrust coefficient equal to Ct=0.88, constant for the
wind speeds considered, and a power curve as shown in Fig. 2. The site
roughness is Zo = 0.3 m.
700
600
500
400
30O
2OO
100
,
6
8
10 12
Wind Speed (M/s)
16
18
111
0.8
....
Fit
min.
....
Fit
ave.
--Fit
4
I
0.7
Pc ~ulation s i z e 2 0 0
max.
i
i
i
,
~=
.~ , , ~ ' ~ ' ~
ir
_,~-.-~ ~-"
-'-~ "-"~
.A=I ~s-
t ~'i
e-
0.6
.[
LL
/"
.~
., i
~-~*
,
~~..,]--.-..,-
0.4
i
0
~=
Q Y~ L,~
~. . . . . . . . . . . .
.~'
100
~'
, t
t,~,'~ ri
i
200
[
300
400
Generation
112
.... Fit
max.
300
100
200
Max.
Fitness
0.8
0.74
09
f:
LL
0.68
*~..,...
0.62
....... !
)~ : ). ~".i.~...:~
[.I [ ;
( .
........4...................
.)
g. . . . . . . .
i
i
0.56
0.5
100
200
300
400
Generation
Fig. 4. Maximum fitness curve for various population sizes for the single direction case
a)
b)
Fig. 5. Positions of the turbines for (a) a single direction, and (b) multiple directions.
113
optimal configuration, as confirmed in Fig. 5b, will therefore have the most of
the turbines along the edges of the domain. In this case an efficiency of 0.35 for
a random configuration having 19 turbines.
In Fig. 6, the behavior of the fitness function is reported for different
population sizes. It can be seen that even in this case, a population of 200
individuals with 350 iterations can be sufficient to reach a well optimized
configuration even starting from a random distribution.
4.3. The case of multiple w i n d direction and intensity
In this case the optimal solution cannot be intuitively found as wind speed,
direction and frequency play a fundamental role in the mutual influence
between different turbines. For the wind distribution, summarized in Fig. 7,
three intensities and 36 directions (every 10) are assumed, while the frequency
is given as a fraction of time unit for which a certain wind exists. In this case
only a calculation with 200 configurations times 400 iterations has been made.
Figure 8 shows the maximum, minimum and average fitness in the population
as a function of the number of iterations, and Fig. 9 shows the number of
turbines for the best configuration found in each iteration. As can be seen, the
optimum number is between 15 and 18 turbines. Figure 10 shows the positions
of the turbines for the multiple direction and multiple intensities case.
The results obtained for all the optimized parameters are summarized in
Table 1, where the parameters for a random configuration having 42 turbines
installed and for an optimized configuration having 15 turbines installed
shown in Fig. 9 are compared. The wind farm efficiency, which is dependent on
the wind orientation only and not on the integral of the produced energy, goes
from 0.34 to 0.84, the energy produced is decreased by 29% but the installation
cost is reduced by 50%.
- - - Fit m a x . 1 0 0
---Fit
24
max.200
--Fit.
Max Fitness
max.300
,1
22.4
~.f ,.
~
~'~
i,W:,
.;;,~'
;
i,,,." ~ ' !
,i.
,--n,r.,
20.8
LL
I 7=' Ji J
i.
19.2
17.6
. . . . . . . . . . . . . .
16
0
100
200
300
400
Generation
Fig. 6. Maximum fitness curve for various population sizes for the multiple direction case.
114
[] 8 m/s
[] 12 m / s
[ ] 17
Wind
m/s
distribution
o-e 3
(D
c-
"O
- 1
0
0
70
140
210
Angle
280
350
(o)
28
.......Fit min.
---Fit ave.
iFit
max.
a
i
i
i
..............L.o..
25
I
i
............. L:,I:.::::::..;;;'C
22
c-
19
U_
16
:~,i;:., f ~ ..............i
i'!ii
-i
"
!.
13
..~
10
0
100
200
300
400
Generation
Fig. 8. M a x i m u m fitness c u r v e for v a r i o u s p o p u l a t i o n sizes for t h e m u l t i p l e d i r e c t i o n a n d
m u l t i p l e i n t e n s i t i e s case.
5. C o m p u t a t i o n t i m e
The computation time required for the optimization is mainly determined by
the windfarm simulation module. More than 90% of the cpu time is spent in the
routines that evaluate the fitness of the configuration. The computation time
is, therefore, almost proportional to the number of calls to the windfarm
115
m
D 3 4
~o
26
E
z
18
10
100
200
300
400
Generation
Fig. 9. N u m b e r of t u r b i n e s as t h e c o n v e r g e n c e proceeds.
Pt= (kWyear)
cost/kWyear
Nt
Random
Optimized
0.50
0.95
13025
12375
2.57 x 10- 3
1.57 10-3
50
25
Random
Optimized
0.35
0.88
9117
8711
3.68 x 10- 3
1.84 x 10- 3
50
19
Random
Optimized
0.34
0.84
4767
3695
7.04 10- 3
3.61 x 10-3
50
15
116
simulation routines. The time needed for the optimization is about 1.25E-3 s per
configuration and wind considered on a CRAY XMP 14 which means t h a t for
the last case considered in this paper about 16000 s of cpu have been used.
However, no attempt has been made yet to optimize the software and,
therefore, a better performance could be expected by increasing the efficiency
of the windfarm evaluation routines.
6. Conclusion
A novel approach to the optimization of large wind farms has been presented.
The feasibility of the approach has been demonstrated and could be applied to
more sophisticated windfarm simulation models. In the present work only
a single turbine type has been considered with simple assumptions, but the
application of the method to more realistic problems would be straightforward
if a realistic "cost" function together with real turbine data are used.
All the optimizations have been performed starting from fully random configurations. If some "rule of thumb" is used to generate the first population, the
computational time required to reach an optimized configuration would probably be highly reduced.
Acknowledgement
This Research was made with M.U.R.S.T. 40% funding.
References
[1] I. Katic, J. Hojstrup and N.O. Jensen, A simple model for cluster efficiency, EWEC '86
Rome, Italy, 7-9 October 1986.
[2] S. Frandsen, On the wind speed reduction in the center of large clusters of wind turbines,
EWEC '91 Amsterdam, The Netherlands.
[3] P. Hajela, Genetic search - an approach to the nonconvex optimization problem, AIAA J.
28(7) (1990).
[4] J.H. Holland, Adaptation in natural and artificial systems (Univ. of Michigan Press, Ann
Arbour, 1975).
[5] L. Davis and M. Steenstrup, Genetic search and simulated annealing (Lawrence Davis
and Morgan Kauffman, Los Altos, 1987).