%0 Journal Article %A ZHANG Jingmin %A MA Li %A LI Yuanyuan %T Improved shuffled frog-leaping algorithm for traveling salesman problem %D 2012 %R %J Computer Engineering and Applications %P 47-50 %V 48 %N 11 %X According to the TSP character, an improved shuffled frog-leaping algorithm is designed. The algorithm improves the child population frog individual optimization way, not just the worst individual optimization. This way can improve the convergent speed of the algorithm effectively. In order to enhance the ability of searching, “guide optimal” probability and “guide suboptimal” probability are put forward. The “guide optimal” probability represents the global optimum solution probability that the individual reversal depends on. The “guide suboptimal” probability represents the subpopulation optimum solution probability that the individual reversal depends on. Through experiments to multiple problems of the TSPLIB, the results show that the algorithm is feasible and effective. %U http://cea.ceaj.org/EN/abstract/article_28418.shtml