Ponencia
Empirical computation of the quasi-optimal number of informants in particle swarm optimization
Autor/es | García Nieto, José Manuel
Alba, Enrique |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2011 |
Fecha de depósito | 2021-05-06 |
Publicado en |
|
Resumen | In the standard particle swarm optimization (PSO), a new
particle’s position is generated using two main informant elements:
the best position the particle has found so far and the
best performer among its neighbors. ... In the standard particle swarm optimization (PSO), a new particle’s position is generated using two main informant elements: the best position the particle has found so far and the best performer among its neighbors. In fully informed PSO, each particle is influenced by all the remaining ones in the swarm, or by a series of neighbors structured in static topologies (ring, square, or clusters). In this paper, we generalize and analyze the number of informants that take part in the calculation of new particles. Our aim is to discover if a quasi-optimal number of informants exists for a given problem. The experimental results seem to suggest that 6 to 8 informants could provide our PSO with higher chances of success in continuous optimization for well-known benchmarks. |
Agencias financiadoras | Ministerio de Ciencia, Innovación y Universidades (MICINN). España Junta de Andalucía |
Identificador del proyecto | TIN2008-06491-C04-01
BES-2009-018767 P07-TIC-03044 |
Cita | García Nieto, J.M. y Alba, E. (2011). Empirical computation of the quasi-optimal number of informants in particle swarm optimization. En GECCO 2011: 13th annual conference on Genetic and evolutionary computation (147-154), Dublin, Ireland: ACM Digital Library. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Empirical computation of the ... | 900.1Kb | [PDF] | Ver/ | |