Shuffled frog leaping algorithm
It is proposed that this article be deleted because of the following concern:
If you can address this concern by improving, copyediting, sourcing, renaming, or merging the page, please edit this page and do so. You may remove this message if you improve the article or otherwise object to deletion for any reason. Although not required, you are encouraged to explain why you object to the deletion, either in your edit summary or on the talk page. If this template is removed, do not replace it. This message has remained in place for seven days, so the article may be deleted without further notice. Find sources: "Shuffled frog leaping algorithm" – news · newspapers · books · scholar · JSTOR Nominator: Please consider notifying the author/project: {{subst:proposed deletion notify|Shuffled frog leaping algorithm|concern=More metaheuristics cruft}} ~~~~Timestamp: 20160721003324 00:33, 21 July 2016 (UTC) Administrators: delete |
The shuffled frog leaping algorithm (SFLA) is an optimization algorithm used in artificial intelligence (AI). It is like a genetic algorithm. [1]
References
- ^ 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
 | This artificial intelligence-related article is a stub. You can help Wikipedia by expanding it. |