Implementation of Differential Evolutionary Algorithm For Different Approaches

IPASJ International Journal of Electronics & Communication (IIJEC)
Web Site: http://www.ipasj.org/IIJEC/IIJEC.htm

Email: editoriijec@ipasj.org
ISSN 2321-5984
A Publisher for Research Motivation........
Volume 4, Issue 4, April 2016
Implementation of Differential Evolutionary

Algorithm for Different Approaches
Swati A. Sharma1, Pankaj P.Prajapati2
1Gujarat
Technology University, Ahmedabad
1Gujarat
Technology University, Ahmedabad
ABSTRACT
An efficient design of optimal circuit is the cornerstone of any design environment. This study introduces a Differential
evolutionary based methodology for optimal testing of benchmark functions. The DE algorithm has been used in many
practical cases and has revealed good convergence properties. It has only a few control parameters, which are kept fixed
throughout the entire evolutionary process. As a relatively new population based optimization technique, differential evolution
has been drawing increasing attention for a wide variety of engineering applications. Unlike the conventional evolutionary
algorithms which depend on predefined likelihood distribution function for mutation process, differential evolution uses the
differences of randomly sampled pairs of objective vectors for its mutation process. Consequently, the object vectors'
differences will pass the objective functions natural information toward the optimization process, and therefore provide more
effective global optimization competence This paper targets at providing an outline of differential evolution and presenting it as
an alternative to evolutionary algorithms with comparison between its different methodologies on the benchmark functions.
Keywords: Optimal Circuit, Differential Evolutionary, Mutation Process, Benchmark Functions
1.INTRODUCTION
Optimization of an electronic circuit is a technique used to select the circuit design factor values in such a way that the actual circuit
performances meet the design requests. There are various optimization techniques have been reported in the past and the recent
times for testing on benchmark functions and then used for various purposes. The gradient-based optimization methods [1] would
generally deliver us with locally optimum solution. Convex optimization techniques [2] require excellent knowledge of circuit
design to find globally optimum solution, which would be very challenging looking at the current state-of-the-art MOSFET models.
The evolutionary algorithms [3] can be used to solve multimodal optimization problems to ascertain the solution space more
strongly. These algorithms do not suffer from complications associated with the gradient-based and convex optimization methods.
These algorithms do not involve awareness of circuit design and physical models. These algorithms also do not need to evaluate
complex mathematical calculation even though they give global optimum solution. Holland has established genetic algorithm (GA)
[4] with a motivation from biological evolution, has been reported several times for automatic analog circuit design. Few recent
citations are also found in [3], [5]. Kennedy and Eberhart had projected particle swarm optimization (PSO) algorithm [6], [7]. They
had been witnessed to give better accurateness compared to GA in most of the applications [8].Differential Evolution [8] [Storn and
Price] is a design tool of optimization that is directly accessible for practical applications. In DE, each value of each variable is
represented by a real number. The benefits of DE are its simple structure, ease of use, speed and robustness. DE uses mutation as a
search mechanism and selection to direct the search toward the potential regions in the feasible region even if no information .is
available. The basic theme behind DE is a new scheme for generating trial parameter vectors [9]. DE generates new parameter
vectors by addition of the weighted difference vector between two population members to a third population. If the resultant vector
yields a lower objective function value than a predetermined population member, the newly generated resultant vector replaces the
vector with which it was compared. At last, the best parameter vector is evaluated for every generation to track the progress made
during the optimization process. Thus DE algorithm has excellent convergence properties.
The rest of the paper is organized as follows: In section 2, working of DE algorithm has been described. Section 3 includes the
implementation of various DE strategies. The simulation results have been provide in section 4.
2.WORKING OF DE ALGORITHM [9]

DE holds two arrays, both of which maintains a population size NP and D dimensional, real-valued vectors. The
primary array holds the current vector population, while the secondary array takes vectors selected for the next
generation In each generation, NP competitions are maintained to determine the composition of the next generation.
Every pair of vectors
) defines a differential vector
).
and
are randomly chosen and their
weighted differential is used to obtain another randomly chosen vector
. This entire method can be mathematically
expressed as:
Page 23


ISSN 2321-5984
=
The weighting (scaling) factor F is a constant supplied by the user in the optimal range between 0.5 and 1.0 [9]. In
every generation, each primary array vector
is targeted for crossover with a vector
producing a trial vector .
Thus, the trial vector (child of two parents), is a noisy random vector and the target vector against which it must
compete. Uniform crossover is used with a crossover constant (CR), in the optimal range of 0.5 to 1.0 which shows the
probability that the child vector inherits the parameter values from the noisy random vector. For instance, when CR =1,
every trial vector parameter inherits its value from
. While if CR = 0, all but one trial vector parameter inherits its
value from the target vector. To ensure
that differs from
by at least one parameter, the trial vector which is
considered as final parameter always comes from the noisy random vector even when CR = 0. Then the objective
function which corresponds to the trial vector is compared with that of the target vector, and the vector having the
lower objective function value of the two would survive for the next generation. This process is continued until the
termination criterion i.e. maximum number of generations (MAXGEN) is met, and difference in objective function
values between two consecutive generations reaches a minimum value.
2.1 PSEUDOCODE FOR DIFERENTIAL EVOUTION ALGORITHM [10]
EvaluatePopulation (Population);
GetBestSolution (Population);
end
return
3. IMPLEMENTATION OF DIFFERENT STRATEGIES [9]

The following are the ten different working strategies:
1. DE/best/1/exp
2. DE/rand/1/exp
3. DE/rand-to-best/1/exp
4. DE/best/2/exp
5. DE/rand/2/exp
6. DE/best/1/bin
7. DE/rand/1/bin
8. DE/rand-to-best/1/bin
9. DE/best/2/bin
10. DE/rand/2/bin
Page 24


ISSN 2321-5984
The general convention used above is DE/x/y/z. DE stands for Differential Evolution, x represents a string denoting the
vector to be perturbed, y is the number of difference vectors considered for perturbation of x, and z stands for the type
of crossover being used (exp: exponential; bin: binomial). Hence the perturbation can be either in the best vector of the
previous generation or in any randomly chosen vector. Similarly for perturbation either single or two vector differences
can be used. For perturbation with a single vector difference, out of the three distinct randomly chosen vectors, the
weighted vector differential of any two vectors is added to the third one. Similarly for perturbation with two vector
differences, five distinct vectors, other than the target vector are chosen randomly from the current population. Out of
these, the weighted vector difference of each pair of any four vectors is added to the fifth one for perturbation. In
exponential crossover, the crossover is performed on the D variables in one loop until it is within the CR bound. The
first time a randomly picked number between 0 and 1 goes beyond the CR value, no crossover is performed and the
remaining D variables are left intact. In binomial crossover, the crossover is performed on each of the D variables
whenever a randomly picked number between 0 and 1 is within the CR value. So for high values of CR, the exponential
and binomial crossover methods yield similar results.
A strategy that works out to be the best for a given problem may not work well when applied to a different problem.
Also, the strategy and the key parameters to be adopted for a problem are to be determined by trial and error. However,
strategy-7 (DE/rand/1/bin) appears to be the most successful and the most widely used strategy.
4.SIMULATIONS AND RESULTS

There are number of benchmark functions are used to test performance of optimization algorithms. Main commonly
used benchmark functions are listed in Table 1. Some of the benchmark functions are listed in Table 2. Initialization
and optimum solution of benchmark functions are listed in Table 3
Table 1: Standard benchmark functions
Function
Type
Global optimum
Type
solution
Sphere
Minimize
Origin
Unimodal
Rastrigin
Minimize
Origin
Multimodal
Griewank
Minimize
Origin
Multimodal
Rosenbrock
Minimize
[1,1,1,1,1,.]n
Unimodal
Ackley
Minimize
Origin
Multimodal
Table 2: Equations of benchmark functions
Page 25

ISSN 2321-5984
Table 3: Initialization and optimum solution of benchmark functions

Function
Dimension
s (n)
Search Space
Sphere
(-5.12,5.12)
10-6
Rosenbrock
Rastrigin
Griewank
Ackley
3
3
3
3
(-2.048,2.048)
(-5.12,5.12)
(-600,600)
(-32 , 32)
10-6
10-6
10-6
10-6
Goal
f0
Differential evolution algorithm is thoroughly tested on various standard benchmark functions and excellent
optimization results have been obtained.
Plot of error function with number of iterations for Sphere function are shown in figure 1 (a), (b)
a) Figure: Sphere function\bin
b) Figure: Sphere function\exp
Plot of error function with number of iterations for Rastrigin function are shown in figure 1 (c), (d), respectively.
c) Figure: Rastrigin function\bin
d) Figure: Rastrigin function\exp
Plot of error function with number of iterations for Greinwank functions are shown in figure 1 (e), (f) respectively.
Page 26

e) Figure: Griewank function\bin

ISSN 2321-5984
f) Figure: Griewank function\exp
Plot of error function with number of iterations for Rosenbrock, functions are shown in figure 1 (g), (h) respectively.
g) Figure: Rosenbrock function\bin
h) Figure: Rosenbrock function\exp
Plot of error function with number of iterations for Ackley function function are shown in figure 1 (i), (j) respectively.
i) Figure: Ackley function\bin
j) Figure: Ackley function\exp
5. CONCLUSION AND FUTURE WORK

Differential evolution gives the best optimum results for the DE/rand/1/bin strategy in most of the benchmark
functions. As a future work, DE algorithm will be used to optimize a few of the analog circuits.
Page 27


ISSN 2321-5984
REFERENCES
[1]. A. Savio, et al., Automatic scaling procedures for analog design reuse, IEEE Cir .and Sys.-I, 2539-2547, Dec.
2006.
[2]. G. Alpaydin, S. Balkir, and G. Dundar, An Evolutionary Approach to Automatic Synthesis of High-Performance
Analog Integrated Circuits, Evolutionary Computation, IEEE Transactions on Volume 7, Issue 3, June pp. 240
252 ,2003.
[3]. M. D. M. Hershenson, S. P. Boyd, and T. H. Lee, "Optimal design of a CMOS op-amp via
geometricprogramming," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.
20, no. 1,pp. 1-21, January 2001.
[4]. H. Gupta and B. Ghosh Analog Circuits Design Using Ant Colony Optimization, Vol. 2, pp. 9-21,IJECCT,
2012.
[5]. Yang XS, Deb S Engineering optimisation by Cuckoo search. Int J Math Modell Numer Optim 1, pp. 30343,
2010.
[6]. R. A. Thakker, M. Shojaei Baghini, M. B. Patil Low-Power Low-Voltage Analog Circuit Design
usingHierarchical Particle Swarm Optimization, IEEE VLSI Design ,pp 427-432 ,2009.
[7]. J Kennedy, and R. C Eberhart., Particle swarm optimization, Proc. Of IEEE Int. Conf. on Neural
Networks,Piscataway, NJ, pp. 1942-1948, 1995.
[8]. Pinar Civicioglu ,Erkan Besdok A conceptual comparison of the Cuckoo-search, particle swarm optimization,
differential evolution and artificial bee colony algorithms, Springer , Science+Business Media B.V. , July 2011.
[9]. Vasan Arunachalam, Optimization Using Differential Evolution, JULY 2008
[10]. Jason Brownlee,Clever Algorithms- Nature-Inspired Programming Recipes Revision 2. 16 June 2012
[11]. Revna Acar Vural and Tulay Yildirim, Swarm Intelligence Based Sizing Methodology for CMOS Operational
Amplifier, 12th IEEE International Symposium on Computational Intelligence and Informatics 2122
November, 2011 Budapest, Hungary
[12]. Jianhai Yu, Zhigang Mao, Automated Design Method for Parameter Optimization of CMOS Analog Circuits
Based on Adaptive Genetic Algorithm,IEEE- Microelectronics Center, Harbin Institute of Technology, Harbin
(2007)
[13]. J.D. Lohn, and S.P. Colombano, A Circuit Representation Technique for Automated Circuit Design,
Evolutionary Computation, IEEE Transactions on Volume 3, Issue 3, Sept. 1999 pp. 205 219.
[14]. Phillip E. Allen and Douglas R. Holberg, CMOS Analog Circuit design, Second edition, Oxford University
Press
[15]. Uday K. Chakraborty, Advances in Differential Evolution,
[16]. Pankaj P. Prajapati, Dr. Mihir V. Shah, Optimization of CMOS based Analog Circuit Using Particle Swarm
Optimization Algorithm
[17]. R. Storn and K. Price, Differential evolutionA simple and efficient heuristic for global optimizationover
continuous spaces, J. Global Optimiz., vol. 11, pp. 341359, 1997
[18]. B.D.Gajjar, Automatic CMOS Analog Circuit Design using PSO algorithm, ME thesis, Gujarat University,2011
Page 28

Implementation of Differential Evolutionary Algorithm For Different Approaches

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Implementation of Differential Evolutionary Algorithm For Different Approaches

Hochgeladen von

Copyright:

Verfügbare Formate

IPASJ International Journal of Electronics & Communication (IIJEC)

Web Site: http://www.ipasj.org/IIJEC/IIJEC.htm

A Publisher for Research Motivation........

Volume 4, Issue 4, April 2016