• DocumentCode
    2815816
  • Title

    A new artificial fish swarm algorithm for dynamic optimization problems

  • Author

    Yazdani, Danial ; Akbarzadeh-Totonchi, Mohammad Reza ; Nasiri, Babak ; Meybodi, Mohammad Reza

  • Author_Institution
    Dept. of Electr., Comput. & IT Eng., Islamic Azad Univ., Qazvin, Iran
  • fYear
    2012
  • fDate
    10-15 June 2012
  • Firstpage
    1
  • Lastpage
    8
  • Abstract
    Artificial fish swarm algorithm is one of the swarm intelligence algorithms which performs based on population and stochastic search contributed to solve optimization problems. This algorithm has been applied in various applications e.g. data clustering, neural networks learning, nonlinear function optimization, etc. Several problems in real world are dynamic and uncertain, which could not be solved in a similar manner of static problems. In this paper, for the first time, a modified artificial fish swarm algorithm is proposed in consideration of dynamic environments optimization. The results of the proposed approach were evaluated using moving peak benchmarks, which are known as the best metric for evaluating dynamic environments, and also were compared with results of several state-of-the-art approaches. The experimental results show that the performance of the proposed method outperforms that of other algorithms in this domain.
  • Keywords
    dynamic programming; search problems; stochastic processes; artificial fish swarm algorithm; dynamic environments optimization problem; dynamic optimization problems; moving peak benchmarks; population; stochastic search; swarm intelligence algorithms; Algorithm design and analysis; Convergence; Equations; Heuristic algorithms; Marine animals; Optimization; Visualization; artficial fish swarm algorithm; dynamic environments; dynamic optimization problems; moving peaks benchmark;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation (CEC), 2012 IEEE Congress on
  • Conference_Location
    Brisbane, QLD
  • Print_ISBN
    978-1-4673-1510-4
  • Electronic_ISBN
    978-1-4673-1508-1
  • Type

    conf

  • DOI
    10.1109/CEC.2012.6256169
  • Filename
    6256169