Research Area:  Cloud Computing

Abstract:

Shuffled frog leaping algorithm, a novel heuristic method, is inspired by the foraging behavior of the frog population, which has been designed by the shuffled process and the PSO framework. To increase the convergence speed and effectiveness, the currently improved versions are focused on the local search ability in PSO framework, which limited the development of SFLA. Therefore, we first propose a new scheme based on evolutionary strategy, which is accomplished by quantum evolution and eigenvector evolution. In this scheme, the frog leaping rule based on quantum evolution is achieved by two potential wells with the historical information for the local search, and eigenvector evolution is achieved by the eigenvector evolutionary operator for the global search. To test the performance of the proposed approach, the basic benchmark suites, CEC2013 and CEC2014, and a parameter optimization problem of SVM are used to compare 15 well-known algorithms. Experimental results demonstrate that the performance of the proposed algorithm is better than that of the other heuristic algorithms.

Keywords:  

Author(s) Name:  Deyu Tang, Jie Zhao, Jin Yang, Zhen Liu, Yongming Cai, Mario Versaci

Publisher name:  ACM Digital Library

DOI:  10.1155/2021/8928182

Volume Information:  Volume 2021

Paper Link:   https://dl.acm.org/doi/abs/10.1155/2021/8928182#:~:text=In%20this%20scheme%2C%20the%20frog,operator%20for%20the%20global%20search.