Hybrid Shuffled Frog Leading Algorithm is an algorithm based on the population distribution changes of frogs foraging on rocks. The algorithm was put forward in 2003, which is a little early, but there are not many related papers, and there is still much room for research and improvement.

In the hybrid leapfrog leading algorithm, the position of each leapfrog represents a feasible solution. There are some stones in the pond where the frog is. In each generation, frogs are assigned to stones. In this generation, only the frog with the worst position on the stone can jump. Frog will jump to the frog in the optimal position on the same stone first, jump to the global optimal position if the new position is worse than the original position, and jump randomly in the solution space if the position is still worse than the original position. It can be seen that each jumping frog jumps at least once and at most three times in each generation, but because the number of frogs jumping each time is equal to the number of stones, when the number of stones