Search

In recent years, Sine Cosine Algorithm (SCA) is a kind of meta-heuristic optimization algorithm with simple structure, simple parameters and trigonometric function principle. It has been proved that it has good competitiveness among the existing optimization algorithms. However, the single mechanism of SCA leads to its insufficient utilization of the information of the whole population, insufficient ability to jump out of local optima and poor performance at solving complex objective function. Therefore, this paper introduces social learning strategy (SL) and elite opposition-based learning (EOBL) strategy to improve SCA, and proposes novel algorithm: enhancing Sine Cosine Algorithm based on elite opposition-based learning and social learning (ESLSCA). Social learning strategy takes full advantage of information from the entire population. The elite opposition-based learning strategy provides a possibility for the algorithm to jump out of local optima and increases the diversity of the population. To demonstrate the performance of ESLSCA, this paper uses 22 well-known benchmark test functions and CEC2019 test function set to evaluate ESLSCA. The comparisons show that the proposed ESLSCA has better performance than the standard SCA and it is very competitive among other excellent optimization algorithms. [ABSTRACT FROM AUTHOR]

Grasshopper optimization algorithm (GOA) is a meta-heuristic algorithm for solving optimization problems by modeling the biological habit and social behavior of grasshopper swarms in nature. Compared with other optimization algorithms, GOA still has room to improve its performance on solving complex problems. Therefore, this paper proposes an improved grasshopper optimization algorithm (EMGOA) based on dynamic dual elite learning and sinusoidal mutation. First of all, dynamic elite learning strategy is adopted to improve the influence of elites on the update process, enabling the algorithm to have a faster convergence speed. Then, sinusoidal function is utilized to guide the mutation of the current global optimal individual during each iteration to avoid the algorithm falling into the local optimum and improve the convergence accuracy of the algorithm. In order to investigate the performance of the proposed EMGOA algorithm, experiments are conducted on 26 benchmark functions and CEC2019 in this paper. The experimental results show that the optimization performance of EMGOA is obviously better than GOA, and EMGOA is competitive with six state-of-the-art meta-heuristic optimization algorithms. [ABSTRACT FROM AUTHOR]

The different communications of users in social networks play a key role in effect to each other. The effect is important when they can achieve their goals through different communications. Studying the effect of specific users on other users has been modeled on the influence maximization problem on social networks. To solve this problem, different algorithms have been proposed that each of which has attempted to improve the influence spread and running time than other algorithms. Due to the lack of a review of the meta-heuristic algorithms for the influence maximization problem so far, in this paper, we first perform a comprehensive categorize of the presented algorithms for this problem. Then according to the efficient results and significant progress of the meta-heuristic algorithms over the last few years, we describe the comparison, advantages, and disadvantages of these algorithms. [ABSTRACT FROM AUTHOR]