Future search algorithm for optimization
This paper proposes a new optimization algorithm named future search algorithm (FSA). This algorithm mimics the person’s life. People in the world search for the best life. If any person found that his life is not good, he tries to change it and he imitates the successful persons. According to this behavior, this algorithm is built by mathematical equations. The FSA can update the random initial. Furthermore, it uses the local search between people and the global search between the histories optimal persons to achieve the best solutions. The proposed algorithm does not have tuned parameters. In addition, it has low computational complexity, fast convergence, and high local optima avoidance. The performance of the proposed algorithm is evaluated by applying it to solve some benchmarks test functions. These test functions have various characteristics necessary to evaluate the FSA. In addition, the performance of the proposed algorithm is compared with five other well-known methods. The results confirm a better performance of the proposed algorithm to get the optimal solution with fewer iterations number than other methods.
KeywordsFuture search algorithm (FSA) Benchmark functions Constrained optimization Meta-heuristic algorithms
Compliance with ethical standards
Conflict of interest
Authors state that there are no conflicts of interest.
This article does not contain any studies with human participants performed by any of the authors.
- 8.Das S, Biswas A, Dasgupta S, Abraham A (2009) Bacterial foraging optimization algorithm: theoretical foundations, analysis, and applications. In: Foundations of computational intelligence, vol 3. Springer, Berlin, pp 23–55Google Scholar
- 15.Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In Evolutionary computation, 2007. CEC 2007. IEEE congress on. IEEE, pp 4661–4667Google Scholar
- 24.Yazdani M, Jolai F (2016) Lion optimization algorithm (LOA): a nature-inspired metaheuristic algorithm. J Comput Des Eng 3(1):24–36.Google Scholar