SciELO - Scientific Electronic Library Online

 
 issue40 author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Article

Indicators

Related links

  • On index processCited by Google
  • Have no similar articlesSimilars in SciELO
  • On index processSimilars in Google

Share


Revista Facultad de Ingeniería Universidad de Antioquia

Print version ISSN 0120-6230

Rev.fac.ing.univ. Antioquia  no.40 Medellín Apr./June 2007

 

Rev.Fac.Ing.Univ.Antioquia N.o 40. pp. 118-122. Junio, 2007

Subpopulation best rotation: a modification on PSO

Rotación de las mejores partículas de las subpoblaciones: una modificación en PSO

Jorge Barrera Alviara*, Jorge Peñab, Roberto Hincapié c

aFacultad de Ingeniería. Universidad de los Andes. Carrera 1 N.º 18ª-10 Bogotá, Colombia.

bFaculté des sciences sociales et politiques (SSP), Institut de Mathématiques Appliquées (IMA), Université de Lausanne, Suisse Unicentre-CH 1015 Lausanne, Suisse.

cGrupo de Investigación, Desarrollo y Aplicación en Telecomunicaciones e Informática (GIDATI). Universidad Pontificia Bolivariana. Circular 1N.º 70-01. Medellín, Antioquia.

(Recibido el 1.º de junio de 2006. Aceptado el 29 de octubre de 2006)

Abstract

This paper deals with a modification on Particle Swarm Optimization (PSO), an original topology whose use can be justified to optimize multimodal functions. The analysis is further verified by some proofs, using different benchmark functions with asymmetric initialization. The method is optimistic and may be a starting point for further discussions.

---------- Key words: Particle Swarm Optimization, evolutionary computation, test functions, neighborhood topology.

Este artículo trata sobre una modificación hecha al método de optimización por enjambre de partículas (PSO), que consiste en una topología original cuyo uso se puede justificar para funciones multimodales. El análisis se verifica con algunas pruebas, usando diferentes funciones de prueba con inicialización asimétrica. El método es optimista y puede ser un punto de partida para futuras discusiones.

---------- Palabras clave: optimización por enjambre de partículas, computación evolutiva, funciones de prueba, topología de vecindario.

Introduction

PSO is an optimization technique inspired by the social behavior of some species and supported by evolutive psychology which suggests that sociocognitive individuals (individuals that know through their own experience and as well as their society experience), must be influenced by their previous behavior and the success of their neighbors [1].

Neighborhood Topologies describe the social structure that makes it possible interaction between individuals within a population. The structure of a social network significantly affects the group performance. In PSO where the individuals or particle behavior can be summarized in three essentials: evaluate, compare and imitate. The method for interactions between particles makes the algorithm work good, poorly or not work at all.

There are two main topologies used in PSO, lbest (ring topology) and gbest (star topology). In a gbest topology each individual knows the performance of all the others, being able to know which one is the best (gbest), on the other hand, in lbest topology, each individual knows the performance of its k topological closer neighbors [1].

Migration is a common technique on genetic algorithms which allow different populations to exchange information by giving the individuals some probability to travel from one to another population. Migration has been widely used for improving genetic algorithms and some others optimization techniques.

The modification suggested is to use some kind of migration in order to create a modified topology. Our proposal is to work with different populations which share no information primarily but achieving interpopulation interaction by the exchange of their best particle.

This paper describes the standard PSO algorithm (SPSO) and the modifications proposed to SPSO are described to facilitate the implementation of the algorithm, further we explain the test functions used to evaluate the algorithm, and the results are exposed and discussed, finally some conclusions are presented.

Standard PSO (SPSO)

PSO explores a D-dimensional space, using a population of particles which are initially provided with random velocity and position in the problem space [2]. Each particle represents a suggested solution and has two kinds of available information, the first kind is about the knowledge of its own experience and the second kind is about the experience of individuals among the whole population [1].

Each particle has a position in the problem space xi = (xi1, xi2,...,xiD), velocity vi = (vi1, vi2,...,viD), and a memory with its best previous position pi = ( pi1, pi2,...,piD). In every iteration for each population, the i particle, whose pi obtains a better fitness, is designated as g, and for each iteration, the pi and pg vectors are used to modify the position of particle i this way:

c1 is known as cognitive factor and c2 as social factor, these define the relative influence of the individual and social behavior in the particle movement. w is known as inertial weight and its function is to control the impact of previous velocity on particle movement. Rand() and rand() are two different random numbers between 0 and 1.

It has been found that a group of values that provide the method with great performance in almost all problems is:

w = 0.4

c1 = c2 = 2

PSO implementation is as follows [2]:

1. Assign iteration Gc = 1.

2. Initialize population by assigning each particle a random position and velocity like this:

xid = xmin + Rand() . (2.xmax)

vid = Rand3() . (2.vmax)

Where:

Rand3() is a random number, and

-1 ≤Rand3() ≤ 1

xmin, xmax and vmax depends on the problem to optimize.

3. Evaluate particle fitness.

4. Update all of the pi.

5. Update g.

6. Change velocity and position for all particles using Eq. 1 and Eq. 2

7. Implement velocity damping for all of the particles:

If vid > vman then vid = vmax

If vid < -vman then vid = -vmax

8. Gc = Gc+1

9. If stop criterion is not reached jump to step 3.

Best rotation PSO (BRPSO)

If PSO uses social knowledge to make the system convergent into a solution it would seem unacceptable to separate particles into almost non communicated subpopulations, and that is true if the problem we are dealing is a monomodal function. These are functions with no other minima than the global one, but in multimodal functions the wide knowledge of the whole population performance make the system converge too fast and also increase the probability of stagnation into local minima.

Best rotation is easy to execute and finds very good solutions for multimodal functions optimization. Its implementation consists on a periodically rotation of the best particle of each subpopulation, in order to specify the frequency used to rotate the best individuals of each population. lc is used to denote how many iterations there will be between rotation and rotation, npo is used to denote the number of subpopulations.

BRPSO can be seen as an extra step between steps 5 and 6 of the algorithm SPSO, like this: If (Gc%lc == 0) Then rotate best individuals

By rotate best individuals it must be understood that ith population must have the best particle of the next population instead of its own original best particle and that the last population must have the best particle of the 1st population instead of its own original best particle.

When best rotation is executed, stagnation on local minima is avoided by forcing populations to move from one local minimum to another one, increasing the exploration of the problem space between different local minima.

Results and discussion

In order to prove the algorithm proposed we used three functions widely used in optimization literature [1], [2], [3].

The function f1 is the Rosenbrock function:

The function f2 is the generalized Rastrigin function:

The function f3 is the generalized Griewank function:

For testing each function we used asymmetrical initialization defined by:

For f1: xi ε (15, 30) with i = 1, 2,..., D

For f1: xi ε (2.56, 5.12) with i = 1, 2,..., D

For f1: xi ε (300, 600) with i = 1, 2,..., D

The values used to make velocity damping and define problem space are as follows:

For f1: xmax = vmax = 100

For f2: xmax = vmax = 10

For f3: xmax = vmax = 600

For every function we tested with 10, 20, 30 dimensions, and 20, 40 and 80 particles for each dimension size. All of the values registered in tables show the mean value of 500 trials. For next tables lc = 50, w = 0.4 and

where m is the number of particles, therefore each population has 10 particles and there are as many populations as groups of ten particles are possible.

In tables 1, 2 and 3, the SPSO results are taken from [4].

Table 1 Mean fitness values for the Rosenbrock function

Table 2 Mean fitness values for the Rastrigin function

Table 3 Mean fitness values for the Griewank function

For these multimodal functions some delay on the convergence increase the capability of the algorithm to optimize the function, and exploration around local minimum helps particles to find even better solutions. It is visible that as more particles are used, the improvement of the best rotation technique is increased.

Conclusion

This paper has explored a new modification on standard PSO, designed to acquire a better performance when optimizing multimodal functions. The best rotation technique delays convergence of the system, prevents local stagnation, and achieves more exploration of the problem space. These characteristics make BRPSO good for multimodal functions optimizing, but unnecessarily slow for easier testing functions.

References

1. J. Kennedy, R. Eberhart, R. Swarm. Intelligence. San Francisco: Morgan Kaufman Publishers. 2001. pp. 287-360.        [ Links ]

2. X. Xie, W. Zhang, Z. Yang. “Hybird Particle Swarm Optimizer with Mass Extinction”. In: International Conference on Communications, Circuits and Systems (ICCCAS). Chengdu, China. Vol. 2. 2002. pp 1170-1173.         [ Links ]

3. A. Carlisle, G. Dozier. “An off-the-Shelf PSO”. In: Proceedings of the workshop on particle swarm optimization. Indianapolis. Vol. 1. 2001. pp 1-6.        [ Links ]

4. X. Xie, W. Zhang, Z. Yang. “Adaptive Particle Swarm Optimization on Individual Level”. En: International Conference on Signal Processing. Beijing, China. Vol. 4. 2002. pp. 1215-1218.         [ Links ]

* Autor de correspondencia: teléfono: +57+1+ 339 99 99. Correo electrónico: jorgeb49@yahoo.es (J. Barrera)