IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v229y2025icp288-303.html
   My bibliography  Save this article

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

Author

Listed:
  • Zhang, Qian
  • Hu, Zhongbo
  • Hong, Nan
  • Su, Qinghua

Abstract

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.

Suggested Citation

  • Zhang, Qian & Hu, Zhongbo & Hong, Nan & Su, Qinghua, 2025. "A fixed point evolution algorithm based on expanded Aitken rapid iteration method for global numeric optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 229(C), pages 288-303.
    • Handle: RePEc:eee:matcom:v:229:y:2025:i:c:p:288-303
    DOI: 10.1016/j.matcom.2024.08.027
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475424003379
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2024.08.027?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:229:y:2025:i:c:p:288-303. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.