SFDE: Shuffled Frog-Leaping Differential Evolution and Its Application on Cognitive Radio Throughput

Abstract

Differential Evolution (abbreviation for DE) is showing many advantages in solving optimization problems, such as fast convergence, strong robustness, and so on. However, when DE faces a complex target space, the diversity of its population will degenerate in a small scope; even sometimes it is premature to fall into the local minimum. All things contend in beauty in the world; a Shuffled Frog Leaping Algorithm (abbreviation for SFLA) has a strong global ability; unfortunately, its convergence speed is also slow. In order to overcome the shortcoming, this article suggests a Shuffled Frog-leaping Differential Evolution (abbreviation for SFDE) algorithm in a cognitive radio network, which combines Differential Evolution with Shuffled Frog Leaping Algorithm. This proposed method hikes its local searching for a certain number of subgroups, and their individuals join together and share their mutual information among different subgroups, which improves the population diversity and achieves the purpose of fast global search during the whole Differential Evolution. The SFDE is examined by 20 well-known numerical benchmark functions, and those obtained results are compared with four other related algorithms. The experimental simulation in solving the problem of effective throughput optimization for cognitive users shows that the proposed SFDE is effective.