A new binary PSO with velocity control

  • Authors:
  • Laura Lanzarini;Javier López;Juan Andrés Maulini;Armando De Giusti

  • Affiliations:
  • III-LIDI (Institute of Research in Computer Science LIDI), Faculty of Computer Science, National University of La Plata, La Plata, Buenos Aires, Argentina;III-LIDI (Institute of Research in Computer Science LIDI), Faculty of Computer Science, National University of La Plata, La Plata, Buenos Aires, Argentina;III-LIDI (Institute of Research in Computer Science LIDI), Faculty of Computer Science, National University of La Plata, La Plata, Buenos Aires, Argentina;III-LIDI (Institute of Research in Computer Science LIDI), Faculty of Computer Science, National University of La Plata, La Plata, Buenos Aires, Argentina

  • Venue:
  • ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Particle Swarm Optimization (PSO) is a metaheuristic that is highly used to solve mono- and multi-objective optimization problems. Two well-differentiated PSO versions have been defined - one that operates in a continuous solution space and one for binary spaces. In this paper, a new version of the Binary PSO algorithm is presented. This version improves its operation by a suitable positioning of the velocity vector. To achieve this, a new modified version of the continuous gBest PSO algorithm is used. The method proposed has been compared with two alternative methods to solve four known test functions. The results obtained have been satisfactory.