Jump to content

Shuffled frog leaping algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by BG19bot (talk | contribs) at 06:18, 19 November 2014 (WP:CHECKWIKI error fix for #03. Missing Reflist. Do general fixes if a problem exists. - using AWB (10486)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Shuffled Frog Leaping Algorithm (SFLA) is an optimization algorithm using in AI (Artificial Intelligence). It is like GA (Genetic Algorithm). [1]

References

  1. ^ Muzaffar Eusuff , Kevin Lansey & Fayzul Pasha (2006) Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization, Engineering Optimization, 38:2, 129-154, DOI: 10.1080/03052150500384759