A Discrete Shuffled Frog Leaping Optimization Algorithm

The Shuffled frog leaping optimization algorithm has been successful in solving a wide range of real-valued optimization problems. . In this paper wepresent a discrete version of the shuffled frog leaping algorithm and compare its performance with the binary genetic algorithm and the discrete particle swarmoptimization algorithm on three low dimensional benchmarks and two high dimensional benchmark problems. The simulation results demonstrates that it out performances other algorithms in term of speed, success rate and accuracy

کلیدواژه ها:

Discrete shuffled frog leaping ، Comparison ، Optimization