作者: Tarun Kumar Sharma , Millie Pant
DOI: 10.1016/J.JOCS.2017.02.008
关键词:
摘要: Abstract Shuffled frog-leaping algorithm (SFLA) is a kind of memetic algorithm. Randomicity and determinacy, the two keywords SFLA ensures flexibility, robustness exchange information effectively in SFLA. In basic structure SFLA, frogs are divided into memeplexes based on their fitness values where they forage for food. this study opposition learning concept embedded before frog initiates foraging. The proposal investigated, analyzed compared with latest variants benchmark functions (unimodal multimodal) along real life problem. result analysis shows that proposed variant performs consistently well different types problems considered study.