Volume 9 Number 10 (Oct. 2014)
Home > Archive > 2014 > Volume 9 Number 10 (Oct. 2014) >
JCP 2014 Vol.9(10): 2352-2358 ISSN: 1796-203X
doi: 10.4304/jcp.9.10.2352-2358

Modified Shuffled Frog-leaping Algorithm with Dimension by Dimension Improvement

Juan Lin, Yiwen Zhong
College of Computer and Information Science, Fujian Agriculture and Forestry University, Fuzhou, China

Abstract—Shuffled leap frog algorithm (SFLA) is a new nature-inspired intelligent algorithm, which uses the whole update and evaluation strategy on solutions. For solving multi-dimension function optimization problems, this strategy will deteriorate the convergence speed and the quality of solution of algorithm due to interference phenomena among dimensions. To overcome this shortage, a dimension by dimension improvement based on SFLA is proposed. The proposed strategy combines an updated value of one dimension with values of other dimensions into a new solution, and that whose updated value can improve the solution will be accepted greedily. Further, a new individual update formula is designed to learn experiences both from the global best and the local best solution simultaneously. Meanwhile, they also reveal the modified algorithm is competitive for continuous function optimization problems compared with other improved algorithms.

Index Terms—shuffled leap frog algorithm, dimension by dimension, multi-dimensional function optimization

[PDF]

Cite: Juan Lin, Yiwen Zhong, "Modified Shuffled Frog-leaping Algorithm with Dimension by Dimension Improvement," Journal of Computers vol. 9, no. 10, pp. 2352-2358, 2014.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>