Genetic Algorithm to the Formation of the Optimal

Structure of Fuzzy Neural Network

E. S. Filatova, D. M. Filatov, A. D. Stotсkaia
Saint Petersburg Electrotechnical University «LETI»

Abstract—Application of genetic algorithm to the formation
of the optimal structure of fuzzy neural networks used in the
short-term forecasting of power consumption is presented.
Keywords—genetic algorithm, fuzzy neural networks,
electrical load forecast
The idea of genetic algorithms as a method of optimal
solutions formation has originally appeared in the late 60s,
early 70s of the XX century. At the present times genetic
algorithms are applied in different research and practice areas
such as optimization function, databases query optimization,
graphs problems, artificial neural network setup and training
tasks, tasks of composition.
Let us consider genetic algorithm in context of formation
fuzzy neural networks (FNN) optimal structure that is use in
the short-term forecasting of power consumption.
The FNN was generated using built-in function of MatLab
genfis2. Dividing space of input and output data into sub
domains, genfis2 function generates ANFIS-structure using
subtractive algorithm [1]. In this function the parameter having
the most influence on structure of FNN and quality of training
and forecasting is clustering radius (or border of variable
influenced areas).
Let us examine building and training ANFIS-system to
demonstrate the influence of this parameter on the quality of
training with two inputs and one output. Forecasting results for
different clustering radiuses are shown on Fig. 1.
6
e1
5 e2
4 adaptation function, because it determines quality of work and
3 was selected criterion that determines the final prediction error
2 Generalized implementation block-diagramm of the
1 classical block-diagramm. The difference is a realization of
0
0 0.1 0.2 0.3 0.4
rad
Fig. 1. Influence of clustering radius value on quality of training FNN and
forecasting
As shown on Fig. 1 (graph e1 – training error, e2 –
forecasting error) training error significantly decreases with the
decrease of clustering radius, but rule base and forecasting
error increase. Thus, rule base increased from 8 to 33 rules with
decreasing radius twice.
At the same time with the decrease of clustering radius
(despite having increased accuracy of training) the FNN loses
input information compilation ability due to rules quantity
increasing, i. e. forecasting error increases. Clustering radius
value is defined empirically in each case.
It can be hard to manually select data clustering radius,
especially for systems with multiple inputs and outputs. And it
is necessary to automate the procedure to implement FNN re-
training. Matlab built-in genetic algorithm (GA) is used to
form the optimal FNN structure for this reason.
Classical GA is consist of following steps: initialization, or
initial chromosome population selection; evaluation of
chromosome adaptation in population; condition of the
algorithm stop checking; chromosome selection; genetic
algorithm applying; new population formation; «best»
chromosome selection [2].
It is necessary to determine genetic algorithm parameters,
namely:
• initial population;
• adaptation function;
• genetic operators (selection, crossover and mutation);
• genetic algorithm stop criterion.
The most important of the parameters from above is the
convergence of genetic algorithm. As an adaptation function
committee of FNN [3].
developed genetic algorithm is fully consistent with the
each step of genetic algorithm. Let’s consider these in details.
0.5 1. Creating initial population. Population size selection
substantially affects on performance and result of GA work. On
Fig. 2 the time taken to search for the optimum is shown by the
dashed line, solid – the accuracy of the algorithm is shown by
solid line.

147 978-1-4673-6961-9/15/$31.00 ©2015 IEEE

 Time of GA work, hour
Prediction error, %
2.5
2 easily extended to multi-criteria optimization problems.
1.5
1 parent pool begin to be dominated by the best, but not optimal
0.5
0
10 20 30 40 50 60
the number of individuals in the population
Fig. 2. Population size influence on performance and result of GA work
With more indiviuals in population GA defines solution
area more thoroughly. Thus probability local minimum finding
is decreasing instead of global one. But large population slows
GA down.
With the increasing in population size (ranging from 30
individuals), forecasting error remains almost unchanged,
while the time spent on the form of an optimal FNN structure
continues to grow (see. fig. 2).
Thus, any population referenced to considered problem is a
matrix with 4x30 size, where 4 – number of chromosomes
represented an individual, and 30 – is the number of
chromosomes in population. Number of chromosomes depends
on number of parameters, determines the uniqueness of the
individual. In this case each individual represents four
clustering radiuses for each FNN, that realize prediction system
[r1 r2 r3 r4], which are the chromosomes forming individual.
Thus, population is consist of individuals [ r1i r2i r3i r4i ],
i = 1 ÷ 30 . Binary coding is not used, each chromosome is
represented in double format, supported by MatLab.
Initial population is set by random in [0, 1] interval, which
defines the clustering radius
2. Selection. It should make a reservation that the selection
procedure involves selecting individuals in the parent pool and
carried out not all of the population, but only from the part
intended for the crossing.
The main feature of this algorithm in MatLab is specified
number of individuals (two by default) move in next generation
(of population) unchanged. These are so called Elite Kids, that
have the best adaptation function values. These individuals are
not involved in crossing.
To prevent premature convergence GA uses adaptation
function scaling. Proportional scaling does not allow to get rid
of large variability of the adaptation value of individuals in
population opposite to the ranking scaling. Second assigns
individuals with the best adaptation function value the highest
rank, equals one. Other individuals are ranked in order of
increasing their adaptation function. Rank scaling function
calculates new values so that scaling value for object with rank
n is obtained directly proportional 1 n .
Selection is done by tournament method. This method is
Researches show that this method is more effective than
roulette method [2]. Furthermore, tournament selection method
helps to avoid the main flaw of roulette method, when the
individuals.
3. Crossing. Crossing is realized by function
crossoverscattered(), which execute random pairwise exchange
70 of chromosomes between formed pairs of parents.
Starting from the first index the first couple of parents from
the parent pool is picked. The first half of selected patents
chromosomes assisted to descendant as it’s first pair of
chromosomes randomly. Then select second pair of
descendant’s chromosomes the same way. Then pick next pair
of parents and continue same way.
It is obvious that as a result of this algorithm of crossing we
may get descendant completely identical from one of the
parents. In addition, the exchange of chromosomes occurs if
strict conformity – the first parents’ chromosome will always
be descendants’ first chromosome. In other words, as a result
of such a crossing chromosomes of the individual can never
change places. To realize a mechanism that allow radically
change individual applies mutation operation.
4. Mutation. Mutation exposed individuals were not
included in the parent pool and non-elite descendant, i.e.
individuals with the worst adaptation function value. Mutation
is realized by function mutationgaussian(), which uses
Gaussian distribution.
Each parent chromosome sum with number generated
randomly with Gaussian distribution. Каждая хромосома
родителя суммируется со случайным образом
сгенерированным числом с распределением Гаусса. As a
result of such a mutation is possible to obtain negative values
of chromosomes, which is unacceptable for the solution of the
problem formulated in this work, built-in MatLab function was
modified so that output chromosome for each descendant had
only positive values.
5. Algorithm stop condition. Stop condition in this case are
two criteria: 1) a finite number of iterations is reached of 50; 2)
algorithm stops in case of no improvements for target function
for the sequence of ten successive generations.
Running time for algorithm was 10 minutes. As a result of
GA were received 4 FNN with different structures determines
by features of the level of detail that they were designed to
predict [3]. Prediction carried forward by one hour from the
history data and hour.
In Table 1 are shown the results clustering radius values
selected manually and using GA and the resulting accuracy of
the forecasting for each FNN
148
 retraining of network when forecasting parameters changes or
TABLE I. CLUSTERING RADIUS SELECTION MANUALLY AND WITH GA if forecasting error became unacceptable.
Forecasting Forecasting
Selection r
system error, % ACKNOWLEDGMENT
GA 0,56
FNN 1 This work was financially supported by a grant of the
Manual 0,60
GA 3,54 President of the Russian Federation № 14.Z56.14.3734-МК
FNN 2
Manual 4,70
GA 4,13
FNN 3 REFERENCES
Manual 5,28
GA 6,29 [1] Diakonov V. MATLAB. Signal and image proccessing. Special
FNN 4 reference / V. Diakonov, I. Abramenkova. SPb.: Piter, 2002. 608 p.
Manual 6,80
GA 1,68% [2] Rutkovskaia D. Neural networks, genetic algorithms and fuzzy systems
Overall forecast
Manual 2,12% [Text] / D. Rutkovskaia, M. Pilin’skii, L Rutkovskii; translate from
Polish I. D. Ruinskii. M.: Hot line Telekom, 2004. 452 p.
As shown in Table 1, with GA forecasting accuracy [3] Filatova E.S., Filatov D.M., Stotskaia A.D. Method for constructing
increased by 0.44 %. Moreover application of GA to automate forecasting system of power consumption based on fuzzy neuro
generation optimal structure FNN allows to realize fast approach and wavelet theory // International journal of applied and basic
researches. 2014. № 11. P. 26-29

149