A Shuffled Frog Leaping Algorithm Using Greedy Search Strategy

Jianguo JiangJournal of Information and Computational Science 2014 · DOI

Abstract

A novel shuffled frog leaping algorithm is proposed to solve the problems of the primordial algorithm, such as non-uniform initial population, low search precision and slow convergence speed. In this algorithm, a newly designed greedy search strategy is applied to do local search, that is, both the worst individual frog and the best one in every sub-population are updated. The initial population is constructed on the basis of the good point set in the number theory. Furthermore, the pattern search method is introduced to improve the performance of the local best individuals. Experimental results show that the efficiency and convergence of the algorithm can be enhanced significantly.
BibTeX
@article{jiang2014shuffled,
  author = {Jianguo Jiang},
  title = {{A Shuffled Frog Leaping Algorithm Using Greedy Search Strategy}},
  journal = {Journal of Information and Computational Science},
  year = {2014},
  doi = {10.12733/jics20102913},
}

Loading related content...

Figure