A Hybrid Shuffled Frog Leaping Algorithm for Solvingthe Symmetric Traveling Salesman Problem

In this paper we propose a hybrid shuffled frogleaping algorithm for solving symmetric travelling salesmanproblem. The hybrid shuffled frog leaping is obtained bycombination of shuffled frog leaping and a local search methodin a hybridizing strategy. The obtained solutions of proposedalgorithm are compared with the solutions obtained by hybridgenetic algorithm. The obtained results demonstrate thathybridizing can considerably improve the performance ofunique algorithms. Also the different versions of shuffled frogleaping algorithms have a better performance then their geneticalgorithm competitors

کلیدواژه ها:

shuffled frog leaping ، symmetric travellingsalesman problem ، hybridizing strategy