A modified binary-PSO for continuous optimization
Metaheuristics based on swarm intelligence simulate the behavior of a biological social system like as a flock of birds or a swarm of bees, and they have achieved important advances for solving optimization problems. In this paper, we propose a variant for a particular kind of those metaheurisitcs:...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2009
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/20886 |
| Aporte de: |
| Sumario: | Metaheuristics based on swarm intelligence simulate the behavior of a biological social system like as a flock of birds or a swarm of bees, and they have achieved important advances for solving optimization problems. In this paper, we propose a variant for a particular kind of those metaheurisitcs: Particle Swarm Optimization (PSO). This modification arises after discovering a low rate of convergence produced by a high level of dispersal at the swarm. Finally, we analyzed and compared the results obtained by an original PSO algorithm and our proposal.
From those, we can see the improvement obtained by our variant since it allows to explore more the search space. |
|---|