• DocumentCode
    2629322
  • Title

    Particle swarm optimization with voronoi neighborhood

  • Author

    Safavieh, Ehsan ; Gheibi, Amin ; Abolghasemi, Mohammadreza ; Mohades, Ali

  • Author_Institution
    Dept. of Math. & Comput. Sci., Amirkabir Univ. of Technol., Tehran, Iran
  • fYear
    2009
  • fDate
    20-21 Oct. 2009
  • Firstpage
    397
  • Lastpage
    402
  • Abstract
    Particle Swarm Optimization (PSO) is an optimization method that is inspired by nature and is used frequently nowadays. In this paper we proposed a new dynamic geometric neighborhood based on Voronoi diagram in PSO. Voronoi diagram is a geometric naturalistic method to determine neighbors in a set of particles. It seems that in realistic swarm, particles take Voronoi neighbors into account. Also a comparison is made between the performance of some traditional methods for choosing neighbors and new dynamic geometric methods like Voronoi and dynamic Euclidean. In this comparison it is found that PSO with geometric neighborhood can achieve better accuracy overall especially when the optimum value is out of the initial range.
  • Keywords
    computational geometry; particle swarm optimisation; Voronoi diagram; Voronoi neighborhood; dynamic Euclidean; dynamic geometric neighborhood; geometric naturalistic method; particle swarm optimization; Computational geometry; Computer science; Evolutionary computation; Genetic algorithms; Laboratories; Linear programming; Mathematics; Optimization methods; Particle swarm optimization; Topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Conference, 2009. CSICC 2009. 14th International CSI
  • Conference_Location
    Tehran
  • Print_ISBN
    978-1-4244-4261-4
  • Electronic_ISBN
    978-1-4244-4262-1
  • Type

    conf

  • DOI
    10.1109/CSICC.2009.5349613
  • Filename
    5349613