News Updates Monday 25th Nov 2024 :
  • Welcome to INPRESSCO, world's leading publishers, We have served more than 10000+ authors
  • Articles are invited in engineering, science, technology, management, industrial engg, biotechnology etc.
  • Paper submission is open. Submit online or at editor.ijcet@inpressco.com
  • Our journals are indexed in NAAS, University of Regensburg Germany, Google Scholar, Cross Ref etc.
  • DOI is given to all articles

Closeness based Hierarchical Particle Swarm Optimizer with Time Varying Acceleration Coefficients


Author : Sambhavi Tiwari and Archana Singh

Pages : 2454-2458
Download PDF
Abstract

A Particle Swarm Optimization algorithm maintains a swarm of particles, where each particle has position vector and velocity vector which represents the potential solutions of the particles. These vectors are updated from the information of global best (Gbest) and personal best (Pbest) of the swarm. All particles move in the search space to obtain optimal solution. In this paper a new concept is introduced of calculating the velocity of the particles with the help of Euclidian Distance concept. This new concept helps in finding whether the particle is closer to Pbest or Gbest and updates the velocity equation accordingly. By this we aim to improve the performance in terms of the optimal solution within a reasonable number of generations.

Keywords: Pbest; Gbest; optimization; uni-modal; multi-modal

Article published in International Journal of Current Engineering and Technology, Vol.5, No.4 (Aug-2015)

 

Call for Papers
  1. IJCET- Current Issue
  2. Issues are published in Feb, April, June, Aug, Oct and Dec
  3. DOI is given to all articles
  • Inpressco Google Scholar
  • Inpressco Science Central
  • Inpressco Global impact factor
  • Inpressco aap

International Press corporation is licensed under a Creative Commons Attribution-Non Commercial NoDerivs 3.0 Unported License
©2010-2023 INPRESSCO® All Rights Reserved