• DocumentCode
    3061320
  • Title

    The Chaotic Particle Swarm Optimization Based on Sub-Energy Tunneling

  • Author

    Yuemei, Yang

  • Author_Institution
    Dept. of Found., Harbin Finance Univ., Harbin, China
  • fYear
    2012
  • fDate
    23-26 June 2012
  • Firstpage
    150
  • Lastpage
    154
  • Abstract
    The premature problem of Particle Swarm Optimization(PSO) leads the missing of the global optima and the failure of searching process. To solve this problem, the chaotic PSO based on sub-energy tunneling is proposed. This algorithm introduces the concept of sub-energy tunneling of TRUST algorithm to transform the objective function in optimization problem. And it uses the Logistic series to replace the random number in PSO. With maintaining the optimization properties of the original objective function, the speed of particles searching the optimization is accelerated. The difference and relationship between the sub-energy tunneling and traditional transform are analyzed. In the numerical experiment, the proposed algorithm and some PSOs based on function transform are compared. The results show that the PSO based on sub-energy tunneling has a higher convergence speed and it can improve the searching efficiency. So the chaotic PSO based on sub-energy tunneling is valid and effective.
  • Keywords
    chaos; particle swarm optimisation; random processes; search problems; TRUST algorithm; chaotic PSO; chaotic particle swarm optimization; convergence speed; function transform; global optima; logistic series; optimization problem; optimization properties; random number; searching efficiency; searching process; subenergy tunneling; Benchmark testing; Chaos; Optimization; Particle swarm optimization; Search problems; Transforms; Tunneling; Particle Swarm Optimization; Sub-energy tunneling; TRUST;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Sciences and Optimization (CSO), 2012 Fifth International Joint Conference on
  • Conference_Location
    Harbin
  • Print_ISBN
    978-1-4673-1365-0
  • Type

    conf

  • DOI
    10.1109/CSO.2012.40
  • Filename
    6274697