A Least Random Shuffled Frog Leaping Algorithm

In the classic implementation of shuffled frog-leaping algorithm, in order to compute the evolution of frog groups (each of size n), the most common way is to first select q (q ≤ n) frogs with unequal probability from each group based on frogs' individual fitness, and then, choosing the frog with th