This document summarizes a research paper that proposes using a Bak-Sneppen model to self-adaptively control three parameters (ω, c, ρ) of particle swarm optimization (PSO). The BS-PSO method was tested on benchmark optimization problems and showed competitive performance compared to other PSO variants without requiring hand-tuning of parameters. Future work is suggested to test the method in dynamic environments, investigate scalability, and further study the critical state behavior of the Bak-Sneppen model.
Exploration of Self-Organized Criticality Models for Parameter Control in Particle Swarm Optimization
1. Carlos M. Fernandes1,2
J.J. Merelo1
Agostinho C. Rosa2
1Departmentof computers architecture and technology, University of
Granada, Spain
2 LaSEEB-ISR-IST, Technical Univ. of Lisbon (IST), Portugal
3. SOC
Deterministic: parameter
values change according to Adaptive: variation depends
deterministic rules indirectly on the problem and
search stage
Self- adaptive: values
evolve together with the
solutions to the problem Hand-tuning
3
ECTA 2012, Barcelona, Spain
4. Bio-inspired: bird
flock and fish
school.
Cultural and social
interaction:
cognitive, social and
random factors.
4
ECTA 2012, Barcelona, Spain
5. X i – position of particle i (vector)
V i – velocity of particle i (vector)
X i(t) =Xρ Xi(t-1)+Xi(t-1)+Vi(t)
i(t-1)+Vi(t)
Vi(t) = Vω Vi(t-1)+c1 r1(pi-xi(t-1))+c2 r2(pg-xi(t-1))
i(t-1)+c1 r1(pi-xi(t-1))+c2 r2(pg-xi(t-1))
c
5
6. SOC: a state of criticality
formed by self-organization
in a long transient period at
the border of order and
chaos.
The Sandpile Model
ECTA 2012, Barcelona, Spain 6
8. [1] BK-inspired Extremal Optimization, Boettcher and
Percus, 2003
[2] Sandpile in Evolutionary Algorithms, Krink et al., 2000-
2001
[3] SOC in PSO, Løvbjerg and Krink, 2004
[4] BK model in Evolutionary Algorithms – Self-Organized
Random Immigrants GA (SORIGA), Tinós and Yang, 2008
[5] Sand Pile Mutation for Genetic Algorithms, Fernandes et
al., 2008-2012
8
ECTA 2012, Barcelona, Spain
9. Per Bak (How Nature Works):
Random numbers are arranged in
a circle. At each time step, the f = 0.41
0.16 f = 0.55
lowest number, and the numbers
at its two neighbours, are
replaced by new random f f= 0.32
= 0.14
numbers.
f = 0.91
f = 0.79
f = 0.23
f = 0.90
ECTA 2012, Barcelona, Spain 9
12. ω
BS model bs_fitness c PSO
ρ
BS species
Particles
12
ECTA 2012, Barcelona, Spain
13. o Sphere, Rastrigin, Rosenbrock, Griewank
o lbest and gbest topologies.
o TVIW-PSO, RANDIW- PSO, GLbestIW-PSO and IA-PSO
o Population size: n = 20
o 3000 generations
13
ECTA 2012, Barcelona, Spain
19. o With a simple set of equations we are able to
control three (four) parameters of the PSO.
o The resulting algorithm is competitive with other
variants of the PSO.
o Full control of the PSO by BS attains good
performance.
o Hand-tuning is not required.
19
ECTA 2012, Barcelona, Spain
20. o Information (state) from PSO into the model.
o Test BS-PSO on dynamic environments.
o Scalability.
o BS critical state: investigate the behaviour
before and after the system reaches the critical
state.
20
ECTA 2012, Barcelona, Spain