|
计算机应用研究 2011
Adaptive chaotic mutation shuffled frog leaping algorithms
|
Abstract:
This paper deals with the performance of shuffled frog leaping algorithm, mainly proposes a shuffled frog leaping algorithm by adding adaptive chaotic mutation operation in processing of global searching. In order to enhance the ability of searching, the algorithm constructs a chaotic operator using Logistic chaotic sequences. Furthermore, the algorithm adaptively adjusts the mutation scale by its individual fitness and evolution generations. In the simulation experiment, both the accuracy and the convergent speed of the proposed algorithm are improved effectively. Therefore, the proposed algorithm has a good practical performance.