Skip to main navigation Skip to search Skip to main content

Convergence analysis of shuffled frog leaping algorithm and its modified algorithm

  • Yingying Xiao*
  • , Xudong Chai
  • , Bohu Li
  • , Qiusheng Wang
  • *Corresponding author for this work
  • Beihang University
  • Beijing Simulation Center

Research output: Contribution to journalArticlepeer-review

Abstract

Based on the analysis of the conditions of shuffled frog leaping (SFL) algorithm, a modified SFL (MSFL) was proposed to deal with the premature and slow convergence. In MSFL, convergence was analyzed based on the theory of geometrical sequence, and two premature judgments were defined, including the dispersion and the fitness variance, to adaptively adjust the coefficients, for balancing convergence accuracy and rate. Six benchmark functions were proposed to test the performances of MSFL, and experiment simulations show that MSFL has higher precision and good stability.

Original languageEnglish
Pages (from-to)15-18+28
JournalHuazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition)
Volume40
Issue number7
StatePublished - Jul 2012

Keywords

  • Convergence analysis
  • Geometrical sequence
  • Multi-objective optimization problem
  • Shuffled frog leaping (SFL) algorithm
  • Update policies

Fingerprint

Dive into the research topics of 'Convergence analysis of shuffled frog leaping algorithm and its modified algorithm'. Together they form a unique fingerprint.

Cite this