IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v34y2023i8d10.1007_s10845-022-02016-w.html
   My bibliography  Save this article

Augmented arithmetic optimization algorithm using opposite-based learning and lévy flight distribution for global optimization and data clustering

Author

Listed:
  • Laith Abualigah

    (Al-Ahliyya Amman University
    Middle East University)

  • Mohamed Abd Elaziz

    (Galala University
    Ajman University
    Zagazig University
    Tomsk Polytechnic University)

  • Dalia Yousri

    (Fayoum University)

  • Mohammed A. A. Al-qaness

    (Zhejiang Normal University
    Sana’a University)

  • Ahmed A. Ewees

    (University of Bisha
    Damietta University)

  • Raed Abu Zitar

    (Sorbonne University-Abu Dhabi)

Abstract

This paper proposes a new data clustering method using the advantages of metaheuristic (MH) optimization algorithms. A novel MH optimization algorithm, called arithmetic optimization algorithm (AOA), was proposed to address complex optimization tasks. Math operations inspire the AOA, and it showed significant performance in dealing with different optimization problems. However, the traditional AOA faces some limitations in its search process. Thus, we develop a new variant of the AOA, namely, Augmented AOA (AAOA), integrated with the opposition-based learning (OLB) and Lévy flight (LF) distribution. The main idea of applying OLB and LF is to improve the traditional AOA exploration and exploitation trends in order to find the best clusters. To evaluate the AAOA, we implemented extensive experiments using twenty-three well-known benchmark functions and eight data clustering datasets. We also evaluated the proposed AAOA with extensive comparisons to different optimization algorithms. The outcomes verified the superiority of the AAOA over the traditional AOA and several MH optimization algorithms. Overall, the applications of the LF and OLB have a significant impact on the performance of the conventional AOA.

Suggested Citation

  • Laith Abualigah & Mohamed Abd Elaziz & Dalia Yousri & Mohammed A. A. Al-qaness & Ahmed A. Ewees & Raed Abu Zitar, 2023. "Augmented arithmetic optimization algorithm using opposite-based learning and lévy flight distribution for global optimization and data clustering," Journal of Intelligent Manufacturing, Springer, vol. 34(8), pages 3523-3561, December.
  • Handle: RePEc:spr:joinma:v:34:y:2023:i:8:d:10.1007_s10845-022-02016-w
    DOI: 10.1007/s10845-022-02016-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-022-02016-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10845-022-02016-w?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.

    References listed on IDEAS

    as
    1. Elaziz, Mohamed Abd & Ewees, Ahmed A. & Ibrahim, Rehab Ali & Lu, Songfeng, 2020. "Opposition-based moth-flame optimization improved by differential evolution for feature selection," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 168(C), pages 48-75.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Adil Yousif & Mohammed Bakri Bashir & Awad Ali, 2024. "An Evolutionary Algorithm for Task Clustering and Scheduling in IoT Edge Computing," Mathematics, MDPI, vol. 12(2), pages 1-18, January.
    2. Ahmed A. Ewees & Mohammed A. A. Al-qaness & Laith Abualigah & Diego Oliva & Zakariya Yahya Algamal & Ahmed M. Anter & Rehab Ali Ibrahim & Rania M. Ghoniem & Mohamed Abd Elaziz, 2021. "Boosting Arithmetic Optimization Algorithm with Genetic Algorithm Operators for Feature Selection: Case Study on Cox Proportional Hazards Model," Mathematics, MDPI, vol. 9(18), pages 1-22, September.
    3. Mohamed Abd Elaziz & Laith Abualigah & Dalia Yousri & Diego Oliva & Mohammed A. A. Al-Qaness & Mohammad H. Nadimi-Shahraki & Ahmed A. Ewees & Songfeng Lu & Rehab Ali Ibrahim, 2021. "Boosting Atomic Orbit Search Using Dynamic-Based Learning for Feature Selection," Mathematics, MDPI, vol. 9(21), pages 1-17, November.
    4. Fan Wang & Xiang Liao & Na Fang & Zhiqiang Jiang, 2022. "Optimal Scheduling of Regional Combined Heat and Power System Based on Improved MFO Algorithm," Energies, MDPI, vol. 15(9), pages 1-30, May.

    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:spr:joinma:v:34:y:2023:i:8:d:10.1007_s10845-022-02016-w. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.