The Bisection–Artificial Bee Colony algorithm to solve Fixed point problems |
| |
| Affiliation: | 1. Department of Mathematics, Arak Branch, Islamic Azad University, Arak, Iran;2. Department of Computer Science, Delhi University, Delhi, India;1. Research Scholar, Department of Mathematics, Gautam Buddha University, Greater Noida, India and Assistant Professor, Department of Mathematics, S.S.V. College, Hapur (C.C.S. University, Meerut), India;2. Assistant Professor, Department of Mathematics, Gautam Buddha University, Greater Noida, India |
| |
| Abstract: | In this paper, we introduce a novel iterative method to finding the fixed point of a nonlinear function. Therefore, we combine ideas proposed in Artificial Bee Colony algorithm (Karaboga and Basturk, 2007) and Bisection method (Burden and Douglas, 1985). This method is new and very efficient for solving a non-linear equation. We illustrate this method with four benchmark functions and compare results with others methods, such as ABC, PSO, GA and Firefly algorithms. |
| |
| Keywords: | Bisection method Fixed point problems Artificial Bee Colony algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
