Ant lion optimizer with adaptive boundary and optimal guidance

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Aiming at the shortcoming that the ant-lion algorithm has unbalanced exploration and development capability, an improved algorithm with adaptive boundary and optimal guidance is proposed. First, the ant lion adjust the scope of the border in order to balance the exploration and development capabilities. Second, through the adaptive best-guided equation, to improve the convergence speed and global search ability. The simulation results of six standard test functions show that the improved algorithm improves the accuracy and convergence speed of the optimal solution compared with other algorithms.

Cite

CITATION STYLE

APA

Wang, R. A., Zhou, Y. W., & Zheng, Y. Y. (2019). Ant lion optimizer with adaptive boundary and optimal guidance. In Advances in Intelligent Systems and Computing (Vol. 856, pp. 379–386). Springer Verlag. https://doi.org/10.1007/978-3-030-00214-5_49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free