A fixed point evolution algorithm based on expanded Aitken rapid iteration method for global numeric optimization

• Published in: Mathematics and computers in simulation Vol. 229; pp. 288 - 303
• Main Authors: Zhang, Qian, Hu, Zhongbo, Hong, Nan, Su, Qinghua
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.03.2025
• Subjects: Evolution algorithms; Expanded Aitken rapid iteration method; Fixed point iterative method; Mathematical models; Evolution algorithms; Mathematical models; Expanded Aitken rapid iteration method; Fixed point iterative method
• ISSN: 0378-4754
• DOI: 10.1016/j.matcom.2024.08.027

Evolution algorithms based on mathematical models whose reproduction operators are derived from mathematical models are a promising branch of metaheuristic algorithms. Aitken rapid iteration method, as a fixed point iteration technique for solving nonlinear equations, performs a procedure of progressive display of a root and generates an iterative sequence that exhibits a convergent trend. Inspired by the idea that an iterative sequence gradually converges to the optimal point during the progressive display procedure of a fixed point of an equation, a fixed point evolution algorithm based on the expanded Aitken rapid iteration method (FPEea) is proposed. To develop FPEea, an expanded Aitken rapid model is first constructed. Then, three polynomials which are derived from the expanded Aitken rapid model are used as the reproduction operator of FPEea to produce offspring. The performance of FPEea is investigated on CEC2019 and CEC2020 benchmark function sets, as well as four engineering design problems. Experimental results show that FPEea is an effective and competitive algorithm compared with several classical evolution algorithms and state-of-the-art algorithms.