Skip navigation

Adams-Bashforth-Moulton optimizer: a novel metaheuristic algorithm for solving engineering optimization problems

Adams-Bashforth-Moulton optimizer: a novel metaheuristic algorithm for solving engineering optimization problems

Deng, Yuanzhao, Jiang, Yao, Zheng, Shuting and Ma, Jixin (2025) Adams-Bashforth-Moulton optimizer: a novel metaheuristic algorithm for solving engineering optimization problems. Cluster Computing, 28:766. ISSN 1386-7857 (Print), 1573-7543 (Online) (doi:10.1007/s10586-025-05508-5)

[thumbnail of Author's Accepted Manuscript] PDF (Author's Accepted Manuscript)
51058 MA_Adams-Bashforth-Moulton_Optimizer_A_Novel_Metaheuristic_Algorithm_For_Solving_Engineering_Optimization_Problems_(AAM)_2025.pdf - Accepted Version
Restricted to Repository staff only until 15 September 2026.

Download (20MB) | Request a copy

Abstract

This paper proposes a novel metaheuristic algorithm for solving engineering optimization problems, called the Adams-Bashforth-Moulton Optimizer (ABMO). The algorithm is inspired by the Adams-Bashforth-Moulton method, a numerical technique used for solving differential equations, which combines the advantages of explicit (Adams-Bashforth) and implicit (Adams-Moulton) methods to improve accuracy and stability through a two-step process of prediction and correction. Despite the success of existing metaheuristic algorithms, many suffer from limitations such as premature convergence, poor exploration-exploitation balance, and high computational cost, particularly in large-scale and complex optimization problems. To address these challenges, ABMO introduces a unique prediction-correction mechanism that dynamically balances exploration and exploitation, ensuring faster convergence and higher solution accuracy while maintaining computational efficiency. We establish a mathematical model of ABMO based on the Adams-Bashforth-Moulton four-step prediction-correction method. To demonstrate the performance of ABMO, we first conduct a qualitative analysis through convergence behavior experiments. Then, ABMO is compared with 11 state-of-the-art algorithms using the CEC2017 and CEC2022 benchmark suites. The results show that ABMO outperforms other comparative algorithms by 91%, 92%, 96%, 67%, and 80% on CEC2017 (30/50/100 dimensions) and CEC2022 (10/20 dimensions), respectively, ranking first in terms of solution quality and convergence speed. Statistical tests, including the Wilcoxon rank sum test and the Friedman test, further confirm the superiority of ABMO. Finally, we apply ABMO to solve nine multi-constraint engineering design problems and to extract core parameters for photovoltaic systems. The results demonstrate that ABMO can find better solutions faster than existing optimizers, demonstrating its great potential in solving real optimization problems.

Item Type: Article
Uncontrolled Keywords: metaheuristic algorithm, Adams-Bashforth-Moulton optimizer, engineering design problems, photovoltaic systems, core parameter extraction
Subjects: Q Science > Q Science (General)
Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty / School / Research Centre / Research Group: Faculty of Engineering & Science
Faculty of Engineering & Science > School of Computing & Mathematical Sciences (CMS)
Last Modified: 22 Sep 2025 09:54
URI: https://gala.gre.ac.uk/id/eprint/51058

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics