RMA-LSCh-CMA, presentation for WCCI'2014 (IEEE CEC'2014)
1. Inuence of regions on the memetic
algorithm
on Real-Parameter Single Objective Optimisation
Daniel Molina1 Benjamin Lacroix2 Francisco Herrera2
1Computer Science, University of Cádiz
2CCIA Deparment, University of Granada
CEC'2014, 9 July 2014
http://sci2s.ugr.es
2. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
Outline
1 Introduction
2 Niching technique: Regions
3 MA-LSCh-CMA
4 RMA-LSCh-CMA
5 Comparisons and results
3. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
Real-parameter single optimisation
Optimisation problems
Global Optima f (x∗
) ≤ f (x)∀x ∈ Domain
Real-parameter Optimisation Domain ⊆ D,
x∗
= [x1, x2, · · · , xD]
Single objective optimisation
An objective/tness function to optimise.
Interested in obtaining only one optimum.
4. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
Memetic Algorithms
Memetic Algorithms for continuous optimisation
Algorithm responsible of the Global Search, exploration.
Local Search Method that renes solutions obtained for
accuracy.
+
8. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
MAs and diversity
To improve the search
LS method should explore in nearly area.
GS algorithm should be focused in exploration.
10. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
Niching technique: Clearing
Problems related with clearing
Expensive (Euclidean distance).
Very sensitive to the niche radio.
11. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
Niching Technique: Regions
Proposal
Divide the domain search in hypercubes, regions.
Only one solution (best) is accepted in one hypercube.
Euclidean distance niches Regions
12. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
Advantages Regions
Region vs distance niching
Simple and quick (no euclidean distance).
13. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
Advantages Regions
Region vs distance niching
Simple and quick (no euclidean distance).
Easy to divide them in smaller hypercubes.
14. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
Region Based Algorithm
Global Search
Only best solution for each region is accepted.
Local Search
Initial LS depth in function the region size.
To explore mainly inside the region.
Regions size
Size of regions is getting smaller during the search.
15. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
In this work
Multimodal optimisation: obtain many optima
RMA-LSCh-CMA, a MA based on regions.
Good results in niching competition (CEC'2013).
Questions for simple optimisation: only one optimum
Improve results for simple optimisation?
Improvement in computer time?
16. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
In this work
Multimodal optimisation: obtain many optima
RMA-LSCh-CMA, a MA based on regions.
Good results in niching competition (CEC'2013).
Questions for simple optimisation: only one optimum
Improve results for simple optimisation?
Improvement in computer time?
MA-LSCh-CMA vs RMA-LSCh-CMA
CEC'2014 benchmark with RMA-LSCh-CMA.
Compare RMA-LSCh-CMA vs MA-LSCh-CMA (no
regions).
17. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
MA-LSCh-CMA
MA-LSCh-CMA
Adapt the LS depth for each solution.
Good results in continuous optimisation.
Features
An Genetic Algorithm as Global Search algorithm.
CMA-ES as Local Search algorithm.
It can apply the LS several times on the same solution.
More promising solutions ⇒ plus LS runs ⇒
⇒ Greater LS depth.
Reference
D. Molina, M. Lozano, C. García-Martínez, F. Herrera. Memetic Algorithms for Continuous Optimization
Based on Local Search Chains. Evolutionary Computation, 18(1), 27-63, 2010.
18. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
MA-LSCh-CMA
A promising solution
It is maintained more time in population.
It can be improved by LS more times.
19. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
MA-LSCh-CMA
LS Chaining
LS continues (LS parameters values) ⇒ more LS depth.
20. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
RMA-LSCh-CMA: Global Search algorithm
Apply crossover
and mutation
Select two
Parents
Ioff
Add Current
Population
New Random
Solution
¿Stopping
Criterion?
¿loff better
than worst?
Replace worst
individual
-
Stop
No
No
Yes
New Random
Solution
Region
Occuped?
No
No
Improve
previous?
Replace worst
individual
Yes
Yes
Mute new
solution
Ioff
Ioff
Ioff
Region
Occuped?
Region
Occuped?
21. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
RMA-LSCh-CMA: LS Application
Original Model
LS Intensity in function of the solution.
Improvement solutions always replaces previous one.
Region model
LS Intensity in function of the solution.
If LS result in one region, maintain only the best solution.
A randomly new solution is generated.
22. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
RMA-LSCh-CMA: Regions division
Region division
Each dimension is divided in ND regions.
After each 25% evaluations, ND = 2 · ND.
23. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
RMA-LSCh-CMA: Regions division
Region division
Each dimension is divided in ND regions.
After each 25% evaluations, ND = 2 · ND.
24. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
RMA-LSCh-CMA: Regions division
Region division
Each dimension is divided in ND regions.
After each 25% evaluations, ND = 2 · ND.
25. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
Experimentation
Experimental test suite
Used the proposed benchmark in CEC'2014, 30 functions.
Tree unimodal function (f1-3).
Thirteen simple multimodal functionS: f4 − f16.
Six hybrid functions: f17 − f22.
Seven composition functions: f23 − f30.
Dimensions 10, 30, 50, 100.
Two stopping criterions:
Error lower than 10-8.
when MAXFEs is achieved. MaxFEs = 100000 · D.
26. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
Experimentation
Experimental test suite
Used the proposed benchmark in CEC'2014, 30 functions.
Tree unimodal function (f1-3).
Thirteen simple multimodal functionS: f4 − f16.
Six hybrid functions: f17 − f22.
Seven composition functions: f23 − f30.
Dimensions 10, 30, 50, 100.
Two stopping criterions:
Error lower than 10-8.
when MAXFEs is achieved. MaxFEs = 100000 · D.
Computational complexity Error obtained
27. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
Parameters
Parameters values in common
Parameter Name Value
Population size 100
Crossover Operator BLX − 0.5
NNAM 3
Istep 100
δLS 10−8
Parameter values for RMA-LSCh-MA
Parameter Name Value
Initial division number (ND) 10
Number of divisions update 4
Multiplier for each update 2
38. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
RMA-LSCh-CMA: results for dimension 100 (II)
Function Mean Median Std
23 3.483111e+02 3.483129e+02 1.373773e-02
24 3.592935e+02 3.590149e+02 7.535504e+00
25 2.341050e+02 2.368728e+02 1.413945e+01
26 2.000780e+02 2.000692e+02 2.536428e-02
27 9.033352e+02 9.112618e+02 1.235201e+02
28 3.179931e+03 3.288493e+03 5.832432e+02
29 3.275740e+03 3.165691e+03 7.553812e+02
30 9.383213e+03 9.247364e+03 9.434189e+02
39. Introduction Regions MA-LSCh-CMA RMA-LSCh-CMA Results
Conclusions
Conclusions
Based Memetic Algorithm improves results also with only
one global optima.
Improvement in time and errors increases with
dimensionality.
Good results in CEC'2014 benchmark?