• DocumentCode
    3532364
  • Title

    AIPSO: Adaptive Informed Particle Swarm Optimization

  • Author

    Neshat, Mehdi ; Rezaei, Masoud

  • Author_Institution
    Dept. of Comput. Eng., Univ. Islamic Azad of shirvan branch, Mashhad, Iran
  • fYear
    2010
  • fDate
    7-9 July 2010
  • Firstpage
    438
  • Lastpage
    443
  • Abstract
    A novel technique is proposed in this paper to optimize the Particle Swarm Optimization (PSO) algorithm. It is named Informed Particle Swarm Optimization (IPSO). A new treatment is added to the conventional PSO which eliminates blind searching in the conventional PSO. In the proposed algorithm, each particle will search it´s around by a variable radius before following the gbest and pbest. It makes the proposed algorithm faster in searching the search space and better in finding the optimum point. The radius which each particle can will be decreases look around during the optimization by a nonlinear function. Because of the non blinding search, in the proposed algorithm, probability of falling in the best local is significantly decreased. The proposed algorithm is applied on some benchmarks and simulation results show advantages of the proposed IPSO.
  • Keywords
    particle swarm optimisation; probability; search problems; AIPSO algorithm; adaptive informed particle swarm optimization; blind search elimination; falling probability; Biological system modeling; Evolution (biology); Fluctuations; Informatics; Kernel; Open systems; Particle swarm optimization; Performance analysis; Regression tree analysis; Thermodynamics; Adaptive; Informed; PSO; Swarm intelligent;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Systems (IS), 2010 5th IEEE International Conference
  • Conference_Location
    London
  • Print_ISBN
    978-1-4244-5163-0
  • Electronic_ISBN
    978-1-4244-5164-7
  • Type

    conf

  • DOI
    10.1109/IS.2010.5548335
  • Filename
    5548335