• DocumentCode
    3395996
  • Title

    A two Sub-swarm Exchange Particle Swarm Optimization considering exploration and exploitation

  • Author

    Zhao, Jia ; Sun, Hui

  • Author_Institution
    Sch. of Inf. Eng., Nanchang Inst. of Technol., Nanchang, China
  • Volume
    2
  • fYear
    2010
  • fDate
    30-31 May 2010
  • Firstpage
    530
  • Lastpage
    533
  • Abstract
    Particle swarm optimization and its modifications appear premature convergence for complex optimization problem, because particles´ performance becomes same in seeking later period. In this paper, A new model is proposed to avoiding particles´ performance same and possessing strong exploration capacity. Considering exploration and exploitation capacity diverse in different stage, the particle swarm is divided into two identical sub-swarms, with the first adopting the standard PSO model, and the second adopting the proposed model. When the two sub-swarms evolve steady states independent, a certain amount of particles of the first sub-swarm that are extracted randomly exchange with the worst fitness value of particles of the second sub-swarm, which can increase the information exchange between the particles, improve the diversity of population and meliorate the convergence of algorithm. Four complex testing functions´ results indicate that the proposed algorithm has greater globally optimal solution,better optimal efficiency and better performance than PSO and TSE-PSO in many aspects.
  • Keywords
    Automation; Constraint optimization; Convergence; Data mining; Mechatronics; Particle swarm optimization; Space exploration; Standards development; Steady-state; Sun; Exploitation; Exploration; Model; Particle Swarm Optimization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Industrial Mechatronics and Automation (ICIMA), 2010 2nd International Conference on
  • Conference_Location
    Wuhan, China
  • Print_ISBN
    978-1-4244-7653-4
  • Type

    conf

  • DOI
    10.1109/ICINDMA.2010.5538254
  • Filename
    5538254