%0 Journal Article
%A LIU Yuan-an
%A ZHANG Hong-guang
%T Binary Shuffled Frog Leaping Algorithm in Population Diversity for Opportunistic Spectrum Assignment
%D 2013
%R 10.13190/jbupt.201303.96.zhanghg
%J Journal of Beijing University of Posts and Telecommunications
%P 92-96
%V 36
%N 3
%X <p>Binary shuffled frog leaping algorithm (BSFLA) in population diversity is proposed for a cognitive radio allocation model, which is a NP-hard problem. The integer coding manner and the searching method is applied in the shuffled frog leaping algorithm. BSFLA utilizes binary coding manner, explores application of the cultural orientation method to accomplish the searching for the optimal solution. Based on schemata theory, the population diversity is defined using hamming distance in order to judge the premature phenomenon. When the premature phenomenon appears, the population reconstruction is done under the elitist retention conditions to avoid falling into the local optimal point. To demonstrate the effectiveness of the proposed algorithm, An experiment for contrast on 100 various network topologies is done. For three fitness functions, the success rates that the proposed algorithm is superior to particle swarm optimization, genetic algorithm and quantum genetic algorithm are equal to 100%, 75% and 100% respectively.</p>
%U https://journal.bupt.edu.cn/EN/10.13190/jbupt.201303.96.zhanghg