• DocumentCode
    3345893
  • Title

    Modified shuffled frog leaping algorithm based on new searching strategy

  • Author

    Ping Luo ; Qiang Lu ; Chenxi Wu

  • Author_Institution
    Coll. of Autom., Hangzhou Dianzi Univ., Hangzhou, China
  • Volume
    3
  • fYear
    2011
  • fDate
    26-28 July 2011
  • Firstpage
    1346
  • Lastpage
    1350
  • Abstract
    Shuffled frog leaping Algorithm (SFLA) is a new metaheuristic optimization algorithm with simple structure and fast convergence speed. This paper presents a modified shuffled frog leaping algorithm (MSFLA) based on a new searching strategy in which the frog adjusts its position according to the best individual within the memeplex and the global best of population simultaneously. Moreover, an effect factor was introduced to balance the global search ability and the local search ability in the strategy. Five benchmark functions were selected to compare the performance of MSFLA with SFLA. The simulation results show that the searching properties including convergence speed and the precision of MSFLA are obviously better than those of the original SFLA.
  • Keywords
    heuristic programming; optimisation; search problems; global search ability; local search ability; memeplex; metaheuristic optimization algorithm; modified shuffled frog leaping algorithm; searching strategy; Algorithm design and analysis; Benchmark testing; Chaos; Convergence; Educational institutions; Heuristic algorithms; Optimization; Shuffled frog leaping algorithm; effect factor; optimization; searching strategy;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Natural Computation (ICNC), 2011 Seventh International Conference on
  • Conference_Location
    Shanghai
  • ISSN
    2157-9555
  • Print_ISBN
    978-1-4244-9950-2
  • Type

    conf

  • DOI
    10.1109/ICNC.2011.6022273
  • Filename
    6022273