Hybrid particle swarm – evolutionary algorithm for search and optimization

  • Authors:
  • Crina Grosan;Ajith Abraham;Sangyong Han;Alexander Gelbukh

  • Affiliations:
  • Department of Computer Science, Babeş-Bolyai University, Cluj-Napoca, Romania;School of Computer Science and Engineering, Chung-Ang University, Seoul, Korea;School of Computer Science and Engineering, Chung-Ang University, Seoul, Korea;Centro de Investigación en Computación (CIC), Instituto Politécnico Nacional (IPN), Mexico

  • Venue:
  • MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Particle Swarm Optimization (PSO) technique has proved its ability to deal with very complicated optimization and search problems. Several variants of the original algorithm have been proposed. This paper proposes a novel hybrid PSO – evolutionary algorithm for solving the well known geometrical place problems. Finding the geometrical place could be sometimes a hard task. In almost all situations the geometrical place consists more than one single point. The performance of the newly proposed PSO algorithm is compared with evolutionary algorithms. The main advantage of the PSO technique is its speed of convergence. Also, we propose a hybrid algorithm, combining PSO and evolutionary algorithms. The hybrid combination is able to detect the geometrical place very fast for which the evolutionary algorithms required more time and the conventional PSO approach even failed to find the real geometrical place.