Bee and Frog Co-Evolution Algorithm and its application

Wang, Hongbo; Ren, Xuena; Tu, Xuyan

doi:10.1016/j.asoc.2017.02.030

Cited by 9 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Table 3 shows the precision of the solution to seven benchmark functions based on the original SFLA, three MSFLAs and other four improved variants. Among them, the BFCEA algorithm combines mnemonic SFLA with cooperation and mutation (abbreviation for MSFLACM) with an improved artificial bee colony (abbreviation for ABC) [24]. The data comparison in Table 3 shows that the three MSFLAs proposed in this paper have better robustness and generalization abilities.…”

Section: Experiments and Discussionmentioning

confidence: 98%

A modified shuffled frog leaping algorithm with inertia weight

Zhao

Wang

Liu

et al. 2023

Preprint

View full text Add to dashboard Cite

The shuffled frog leaping algorithm (SFLA) is a promising metaheuristic bionics algorithm, which has been designed by the shuffled complex evolution (SCE) and the particle swarm optimization (PSO) framework. But it is easily trapped into local optimum and has the low optimization accuracy when it is used to optimize the complex engineering problems. To overcome the short-comings, a novel modified shuffled frog leaping algorithm (MSFLA) with inertia weight is proposed in this paper. To extend the scope of the direction and length of the updated worst frog (vector) of the original SFLA, the inertia weight α was introduced and its meaning and range of the new parameters are fully explained. Then the convergence of the MSFLA is deeply analyzed and proved theoretically by a new dynamic equation formed by Z-transform. Finally, we have compared the solution of 7 benchmark function with the original SFLA, other improved SFLAs, genetic algorithm (GA), PSO, artificial bee colony (ABC) algorithm, and the grasshopper optimization algorithm with invasive weed optimization (IWGOA). The testing results showed that the modified algorithms can effectively improve the solution accuracies and convergence properties, exhibited an excellent ability of global optimization in high-dimensional space and complex function problems.

show abstract

Section: Experiments and Discussionmentioning

confidence: 98%