• DocumentCode
    2916852
  • Title

    A Fast Bacterial Swarming Algorithm for high-dimensional function optimization

  • Author

    Chu, Ying ; Mi, Hua ; Liao, Huilian ; Ji, Zhen ; Wu, Q.H.

  • Author_Institution
    Texas Instrum. DSPs Lab., Shenzhen Univ., Shenzhen
  • fYear
    2008
  • fDate
    1-6 June 2008
  • Firstpage
    3135
  • Lastpage
    3140
  • Abstract
    A novel fast bacterial swarming algorithm (FBSA) for high-dimensional function optimization is presented in this paper. The proposed algorithm combines the foraging mechanism of E-coli bacterium introduced in bacterial foraging algorithm (BFA) with the swarming pattern of birds in block introduced in particle swarm optimization (PSO). It incorporates the merits of the two bio-inspired algorithms to improve the convergence for high-dimensional function optimization. A new parameter called attraction factor is introduced to adjust the bacterial trajectory according to the location of the best bacterium (bacterium with best fitness value). An adaptive step length is adopted to improve the local search ability. The algorithm has been evaluated on standard high-dimensional benchmark functions in comparison with BFA and PSO respectively. The simulation results have demonstrated the fast convergence ability and the improved optimization accuracy of FBSA.
  • Keywords
    artificial life; particle swarm optimisation; attraction factor; bacterial foraging algorithm; bioinspired algorithms; fast bacterial swarming algorithm; high-dimensional benchmark functions; high-dimensional function optimization; local search ability; Ant colony optimization; Birds; Computational modeling; Convergence; Genetic algorithms; Marine animals; Microorganisms; Particle swarm optimization; Power system harmonics; Power system simulation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on
  • Conference_Location
    Hong Kong
  • Print_ISBN
    978-1-4244-1822-0
  • Electronic_ISBN
    978-1-4244-1823-7
  • Type

    conf

  • DOI
    10.1109/CEC.2008.4631222
  • Filename
    4631222