Improved Shuffled Frog-Leaping Algorithm and Its Application

摘要

This paper proposes an improved shuffled frog-leaping algorithm, the algorithm improves the subpopulation frog individual optimization way which is not just the worst individual optimization. "Guide optimal" probability and "guide suboptimal" probability are put forward. The experiments results of multiple problems of the TSPLIB show that the algorithm is feasible and effective.