83 views

Uploaded by dimitrioschr

Presentation Slides in pdf format

Presentation Slides in pdf format

Attribution Non-Commercial (BY-NC)

- Help the Genetic Algorithm to Minimize the Urban Traffic on Intersections
- Differential Evolution for Multi-Objective Optimization
- Differential Evolution
- Differential evolution
- Resource Allocation Using Genetic Algorithms
- MELJUN CORTES Clonal Selection Algorithm Research Study
- A Genetic Algorithm Tutorial
- Modeling and Optimizing RFID Network Planning by Using Genetic Algorithms as a Computational Intelligent Technique
- 3.5_kumar
- OPTIMAL DESIGN OF WATER DISTRIBUTION SYSTEMS BY A COMBINATION OF STOCHASTIC ALGORITHMS AND MATHEMATICAL PROGRAMMING
- Search for Maximal Snake-in-the-Box Using New Genetic Algorithm
- 0163-Design of Genetic Algorithm Based Fuzzy Logic Power System Stabilizers in Multi Machine Power
- OPTIMAL ECONOMIC LOAD DISPATCH USING FUZZY LOGIC & GENETIC ALGORITHMS
- Genetic Algorithms
- lec4.pps
- 2_USE OF GENETIC ALGORITHMS FOR THE OPTIMAL DESIGN OF FLAT PLATE SOLAR.pdf
- Improved Shuffled Frog Leaping Algorithm for the Combined Heat and Power Economic Dispatch.
- 6. Applied-Optimization of Banks Loan Portfolio Management-Agarana
- zonas sísmicas
- 1-s2.0-S1110016818301534-main.pdf

You are on page 1of 40

Kelly Fleetwood

Synopsis

Stochastic, population-based optimisation algorithm Introduced by Storn and Price in 1996 Developed to optimise real parameter, real valued functions General problem formulation is: For an objective function f : X RD R where the feasible region X = , the minimisation problem is to nd x X such that f (x ) f (x) x X where: f (x ) =

Global optimisation is necessary in elds such as engineering, statistics and nance But many practical problems have objective functions that are nondierentiable, non-continuous, non-linear, noisy, at, multi-dimensional or have many local minima, constraints or stochasticity Such problems are dicult if not impossible to solve analytically DE can be used to nd approximate solutions to such problems

Evolutionary Algorithms

DE is an Evolutionary Algorithm This class also includes Genetic Algorithms, Evolutionary Strategies and Evolutionary Programming

Initialisation

Mutation

Recombination

Selection

Notation

Suppose we want to optimise a function with D real parameters We must select the size of the population N (it must be at least 4) The parameter vectors have the form: xi,G = [x1,i,G , x2,i,G , . . . xD,i,G ] i = 1, 2, . . . , N. where G is the generation number.

Initialisation

Initialisation

Mutation

Recombination

Selection

Dene upper and lower bounds for each parameter: xL xj,i,1 xU j j Randomly select the initial parameter values uniformly on the intervals [xL , xU ] j j

Mutation

Initialisation

Mutation

Recombination

Selection

Each of the N parameter vectors undergoes mutation, recombination and selection Mutation expands the search space For a given parameter vector xi,G randomly select three vectors xr1,G , xr2,G and xr3,G such that the indices i, r1, r2 and r3 are distinct

Mutation

Initialisation

Mutation

Recombination

Selection

Add the weighted dierence of two of the vectors to the third vi,G+1 = xr1,G + F (xr2,G xr3,G ) The mutation factor F is a constant from [0, 2] vi,G+1 is called the donor vector

Recombination

Initialisation

Mutation

Recombination

Selection

Recombination incorporates successful solutions from the previous generation The trial vector ui,G+1 is developed from the elements of the target vector, xi,G , and the elements of the donor vector, vi,G+1 Elements of the donor vector enter the trial vector with probability CR

Recombination

Initialisation

Mutation

Recombination

Selection

uj,i,G+1

randj,i U [0, 1], Irand is a random integer from [1, 2, ..., D] Irand ensures that vi,G+1 = xi,G

Selection

Initialisation

Mutation

Recombination

Selection

The target vector xi,G is compared with the trial vector vi,G+1 and the one with the lowest function value is admitted to the next generation u i,G+1 if f (ui,G+1 ) f (xi,G ) xi,G+1 = i = 1, 2, . . . , N xi,G otherwise Mutation, recombination and selection continue until some stopping criterion is reached

DE with N = 10, F = 0.5 and CR = 0.1 Ackleys function f (x1 , x2 ) = 20+e20exp 0.2 1 2 (x1 + x2 ) exp 2 n 1 (cos(2x1 ) + cos(2x2 )) n

15

10

f(x)

5 5

0 2 3 4 5

x1

14

4 12 3

10

1 8 x2 0 6 1

3 2 4

5 5

0 x1

Example: Initialisation

x2

5 5

0 x1

Example: Mutation

x2

5 5

0 x1

Example: Mutation

x2

5 5

0 x1

Example: Mutation

x2

5 5

0 x1

Example: Mutation

x2

5 5

0 x1

Example: Mutation

x2

5 5

0 x1

Example: Recombination

x2

5 5

0 x1

Example: Selection

x2

5 5

0 x1

Example: Selection

x2

5 5

0 x1

Example: Selection

x2

5 5

0 x1

Example: Mutation

x2

5 5

0 x1

Example: Mutation

x2

5 5

0 x1

Example: Mutation

x2

5 5

0 x1

Example: Mutation

x2

5 5

0 x1

Example: Mutation

x2

5 5

0 x1

Example: Recombination

x2

5 5

0 x1

Example: Recombination

x2

5 5

0 x1

Example: Selection

x2

5 5

0 x1

Example: Selection

x2

5 5

0 x1

Example: Generation 2

x2

5 5

0 x1

Example: Generation 1

x2

5 5

0 x1

Example: Movie

Performance

There is no proof of convergence for DE However it has been shown to be eective on a large range of classic optimisation problems In a comparison by Storn and Price in 1997 DE was more ecient than simulated annealing and genetic algorithms Ali and Trn (2004) found that DE was both more accurate and more o ecient than controlled random search and another genetic algorithm In 2004 Lampinen and Storn demonstrated that DE was more accurate than several other optimisation methods including four genetic algorithms, simulated annealing and evolutionary programming

Recent Applications

Design of digital lters Optimisation of strategies for checkers Maximisation of prot in a model of a beef property Optimisation of fermentation of alcohol

Further Reading

Price, K.V. (1999), An Introduction to Dierential Evolution in Corne, D., Dorigo, M. and Glover, F. (eds), New Ideas in Optimization, McGrawHill, London. Storn, R. and Price, K. (1997), Dierential Evolution - A Simple and Ecient Heuristic for Global Optimization over Continuous Spaces, Journal of Global Optimization, 11, pp. 341359.

- Help the Genetic Algorithm to Minimize the Urban Traffic on IntersectionsUploaded byWhite Globe Publications (IJORCS)
- Differential Evolution for Multi-Objective OptimizationUploaded bySerdar Karataş
- Differential EvolutionUploaded byMadhusudan Rao
- Differential evolutionUploaded byRahul Mayank
- Resource Allocation Using Genetic AlgorithmsUploaded byIJSER ( ISSN 2229-5518 )
- MELJUN CORTES Clonal Selection Algorithm Research StudyUploaded byMELJUN CORTES, MBA,MPA
- A Genetic Algorithm TutorialUploaded bymanojkumar
- Modeling and Optimizing RFID Network Planning by Using Genetic Algorithms as a Computational Intelligent TechniqueUploaded bychienql
- 3.5_kumarUploaded byfernandokg
- Search for Maximal Snake-in-the-Box Using New Genetic AlgorithmUploaded byCollin Watts
- 0163-Design of Genetic Algorithm Based Fuzzy Logic Power System Stabilizers in Multi Machine PowerUploaded bySoma Soren
- OPTIMAL ECONOMIC LOAD DISPATCH USING FUZZY LOGIC & GENETIC ALGORITHMSUploaded byIAEME Publication
- OPTIMAL DESIGN OF WATER DISTRIBUTION SYSTEMS BY A COMBINATION OF STOCHASTIC ALGORITHMS AND MATHEMATICAL PROGRAMMINGUploaded byRobert Aguedo
- Genetic AlgorithmsUploaded byluffydmon
- lec4.ppsUploaded byJohn Wiggins
- 2_USE OF GENETIC ALGORITHMS FOR THE OPTIMAL DESIGN OF FLAT PLATE SOLAR.pdfUploaded byGiuseppe
- Improved Shuffled Frog Leaping Algorithm for the Combined Heat and Power Economic Dispatch.Uploaded byHCTL Open
- 6. Applied-Optimization of Banks Loan Portfolio Management-AgaranaUploaded byImpact Journals
- zonas sísmicasUploaded byGuillermo
- 1-s2.0-S1110016818301534-main.pdfUploaded byManyata
- e 31034043Uploaded byAnonymous 7VPPkWS8O
- Gigs 0541Uploaded byrumabiswas853
- DeterminationUploaded byRenato Oliveira
- icinco2009-1-onctiUploaded byGustavo Sánchez
- A Solution to an Economic DispatchUploaded byDika Lazuardi
- eka1Uploaded byEka Handayani
- 07_chapter2_2Uploaded bymanish
- Survey RN 76Uploaded byanotherstupidregistr
- HybridUploaded byparassu
- Optimizing the Parameters of Wavelets for Pattern Matching Using GaUploaded byIAEME Publication

- The modelling of extreme eventsUploaded bydimitrioschr
- FassUploaded bydimitrioschr
- Examining the Nelson-Siegel Class of Term Structure ModelsUploaded bydimitrioschr
- 19607034 Salomon Smith Barney Principles of Principal Components a Fresh Look at Risk Hedging and Relative ValueUploaded byRodrigo
- Guidance mathematicsUploaded bydimitrioschr
- Creating Money Through Banking SystemUploaded byVijay Agrahari
- vixwhiteUploaded byDave Wang

- mandic_NGD_NLAF_GSSUploaded byPrayag Gowgi
- lmUploaded byLeonora C. Ford
- HW #2Uploaded bysshanbhag
- Butterfly diagramUploaded byvargil
- scipyUploaded bymz_haq
- Polynomial ZerosUploaded bycarman007
- Travelling SalesmanUploaded bydmehary
- WekaUploaded byLalithaJyothi
- Exercise 2Uploaded byAmrinder Setia
- slidingdftUploaded bychdev007
- REPASO_01Uploaded byNoesito Aquino Aquino
- RaptorX _ Software for Protein Modeling and Analysis - Wikipedia, The Free EncyclopediaUploaded byRafaél Berroya Navárro
- Experiment No. 2 - Approximation and Round-Off ErrorsUploaded byCedric Dela Cruz
- ICCV15-Tutorial-Math-Deep-Learning-Intro-Rene-Joan.pdfUploaded byMuhammad Ahmad
- Cubic SplineUploaded byATUL CHAUHAN
- EMA 523641Uploaded byLheidyy36
- Chapter3 ConvertedUploaded byAngel Paguay
- Kuhn Tucker ConditionsUploaded byBarath
- MCQ Class X Polynomials Question AnswersUploaded bypri911
- OR.mcq(3)Uploaded byBadder Danbad
- 9783319431611-c2Uploaded byAbdman Wayo
- Math 311 Numerical Solutions of Ordinary Differential Equations.docUploaded bymartinariel79
- Unit2_2Uploaded bysadhanaa
- Open MethodsUploaded byHari Purnomo Adi
- cheatsheet_luckycallorUploaded bymmmax
- Strassen's Matrix MultUploaded bymishraelectric
- Linear Programming With BoundsUploaded byKeivn Simiyu
- Errors and Approximations PDFUploaded byMelissa
- Pattern Classification SlideUploaded byTiến Quảng
- Method of Finding Multiple Root of a PolynomialUploaded byAmbrish Singh