An Improved Future Search Algorithm Based on the Sine Cosine Algorithm for Function Optimization Problems

Abstract

Future search algorithm imitates the person living life. If one person finds that his life is not good, he will try to change his living life, and he will imitate a more successful person. To overcome insufficient performances of the basic Future search algorithm, this paper proposed an improved Future search algorithm based on the sine cosine algorithm (FSASCA). The proposed algorithm uses sine cosine algorithm to loop-progressive find the best solution. The searching method of the sine cosine algorithm can make the feasible solution to be re-positioned around another feasible solutions, which can make the proposed algorithm have a strong exploitation ability. Four coefficient factors are added in the basic FSA, and new update methods are introduced in the searching phase. To verify the searching and optimization performances of the proposed algorithm in this paper, this paper also gives data calculation results, Wilcoxon rank sum test , iteration figures, box plot figures, and searching path figures. Experimental results showed that FSASCA has a better iteration speed, the convergence precision, the solving accuracy, the strong competitive, and the high balance.INDEX TERMS Future search algorithm, sine cosine algorithm, optimization problem, function optimization.

Breast Cancer Classification from Histopathological Images using Future Search Optimization Algorithm and Deep Learning

“…In this work, the FSA optimizes the hyperparameter values in the ResNeXt approach by simulating optimal lifestyles for individuals, mapping this concept to the selection process of ResNeXt's hyperparameters. Employing a mathematical formula, the FSA enhances the initial random parameters through a global search among successful individuals and a local search within the population [22]. The FSA can be generated dependent upon mathematical formulas and begins phases depending on random solutions:…”

An Enhanced Neural Network Algorithm with Quasi-Oppositional-Based and Chaotic Sine-Cosine Learning Strategies

“…In the real world, optimization problems are often highly intricate and exhibit nonlinear characteristics [ 12 ], which frequently involve multiple local optima within the objective function. Consequently, deterministic methods often encounter difficulties in escaping local minima when dealing with complex optimization problems [ 13 , 14 ]. Instead, metaheuristics are inspired by phenomena observed in nature and simulate these phenomena to efficiently optimize and solve problems without relying on complex gradient information and mathematical principles thereby better exploring optimal solutions [ 15 , 16 , 17 ].…”