A modern procedure to solve fixed point functions using Bisection- Social Spider Algorithm

In this paper, we introduce a new iterative method to finding the fixed point of a nonlinear function. Therefore, we merge ideas proposed in Social Spider Algorithm and Bisection method. This method is new and very efficient for solving a nonlinear equation. We explain this method with three benchmark functions and compare results with others methods, such as ALO, MVO, SSA.

Keywords:

meta-heuristic algorithms , Fixed point problems , Social Spider Algorithm , Bisection algorithm.