Abstract

Abstract Aiming at the problem of low convergence precision and premature convergence of fruit fly optimization algorithm (FOA), this paper proposes a novel fruit fly optimization algorithm with Levi flight and challenge probability (LCFOA). We introduce the Levi flight mechanism and challenge adjustment process to coordinate the global exploration and local exploitation capabilities of the algorithm. Then, we designed an adaptive challenge factor in the challenge adjustment process to improve the convergence precision of the algorithm. The convergence performance of the algorithm is verified by 6 different benchmark functions. The numerical experimental results comfirmed that the proposed LCFOA has better search precision and convergence speed.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call