Improved Shuffled Frog Leaping Algorithm Based on Quantum Rotation Gates
Abstract
Aiming at the search speed and accuracy of the shuffled frog leaping algorithm not high, the idea of variation was integrated into the shuffled frog leaping algorithm. A new improved shuffled frog leaping algorithm was proposed which was called quantum frog leaping algorithm. The positions of frog are encoded by the probability amplitudes of quantum bits, the movements of frog are performed by quantum rotation gates, which achieve particles searching. Through the experiments on six standard functions, simulation results show the proposed algorithm has high searching efficiency and precision, Moreover, QSFLA as a promising optimization algorithm has strong convergence and high stability.
Keywords
Shuffled frog leaping algorithm, Quantum probability amplitude, Quantum optimization
DOI
10.12783/dtcse/cece2017/14410
10.12783/dtcse/cece2017/14410
Refbacks
- There are currently no refbacks.