finding the fixed point of benchmark functions through the Moth-Flame Optimization Algorithm

The essential purpose of this paper is to obtain the fixed point of different functions by using a modern repetitive method. We incorporate concepts suggested in the fixed point theory and the Moth-Flame Optimization algorithm. This algorithm is more impressive for finding fixed point functions. We also implement this method for five functions and finally compare the current method with other methods such as ALO, MVO, SSA, SCA algorithms. the proposed method shows a decent functionality than the other six methods.

کلیدواژه ها:

Meta-heuristic algorithms ، Fixed point problems ، Moth-Flame Optimization algorithm ، Iterative method