Skip to content

MOAERK5: A fifth-order Runge–Kutta–based metaheuristic optimization algorithm for effective training of multilayer perceptron neural networks

Sep 2026 · Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology · 0 citations · 20 references

TL;DR

Results indicate that coupling high-order Runge-Kutta numerical integration with population-based stochastic search offers an effective, gradient-free strategy for MLP training and other nonlinear optimization problems.

Abstract

Training Multi-Layer Perceptron (MLP) neural networks is a high-dimensional, multimodal, and non-convex weight-optimization problem, and gradient-based methods such as backpropagation remain prone to slow convergence, sensitivity to weight initialization, and entrapment in local minima, motivating the search for gradient-free alternatives. This paper proposes MOAERK5, a novel population-based metaheuristic optimization algorithm derived from the six-stage explicit fifth-order Runge-Kutta (RK5) method for numerical integration. MOAERK5 uses the RK5 slope-estimation scheme to guide candidate solutions through the search space with high numerical precision, and incorporates an Enhanced Solution Quality (ESQ) operator that preserves population diversity and prevents premature convergence to local optima. In this study, the weights and biases of an MLP are encoded as the optimization variables, and the Mean Squared Error (MSE) is minimized over 500 iterations. MOAERK5 is evaluated on eight benchmark problems, five classification tasks (XOR, Balloon, Iris, Breast Cancer, Heart Disease) and three function-approximation tasks (Sigmoid, Cosine, Sine), and is compared against four established metaheuristic algorithms (HHO, GWO, WOA, SCA) over 30 independent runs. Based on Friedman and Wilcoxon signed-rank tests (α = 0.05), MOAERK5 attains the best overall Friedman rank (1.12) and statistically significant superiority over all four competitors in seven of the eight benchmarks, with the lowest error variance on the two most challenging datasets. These results indicate that coupling high-order Runge-Kutta numerical integration with population-based stochastic search offers an effective, gradient-free strategy for MLP training and other nonlinear optimization problems.

View source

Similar papers

Sep 2026

NN-IMODE: a novel approach for simultaneous optimization of architecture and parameters in feedforward neural networks

An improved multi-operator differential evolution algorithm, called NN-IMODE, tailored for comprehensive Feedforward Neural Networks optimization, encompassing the number of hidden layers, neurons per layer, weights, biases, and activation functions, is introduced.

Aridj Ferhat, Farouq Zitouni, Karam M. Sallam et al. · 0 citations
Open access Aug 2026

Evolutionary Training of Neural Networks: The Role of Crossover Operators in Genetic Algorithms Compared with Backpropagation

A systematic comparison of backpropagation and ten variants of a genetic algorithm for training multi-layer perceptrons (MLPs), with particular focus on the role of crossover operators, helps clarify when gradient-free training is competitive and which evolutionary operators drive its effectiveness.

Mikołaj Petecki, W. Książek, Artur Niewiarowski · 0 citations
Open access Aug 2026

Chaotic Sech–Tanh dynamic opposition-based learning for metaheuristic optimization. Part I: strategy development and validation on benchmark and engineering design problems

Abstract Metaheuristic optimization algorithms frequently struggle to maintain an effective balance between exploration and exploitation, particularly on high-dimensional problems where premature convergence and reduced population diversity degrade performance. Opposition-based Learning (OBL) is a widely used remedy, y...

M. Turgut, Mohammad Al-Rawi, O. Turgut et al. · 0 citations
#reinforcement learning Open access Aug 2026

A reinforcement-learning-guided memetic Narwhal Optimization Algorithm for global and engineering optimization

The Narwhal Optimization Algorithm is a recent swarm metaheuristic that, like most population-based optimisers, is prone to premature convergence, is sensitive to random initialisation, and relies on a rigid, schedule-driven exploration–exploitation balance. This paper develops and rigorously evaluates two enhanced v...

A. Al Tawil, S. Z. Hashim, Hanaa Fathi et al. · 0 citations
Open access 2026

Development of a Chaotic Tent Map-Based Pelican Optimization Algorithm for Hyperparameter Optimization

Metaheuristic optimisation algorithms have received a lot of attention due to their ability to solve complicated optimisation problems without using any gradient information. However, the performance of these algorithms may be affected by insufficient exploration, premature convergence and getting stuck in local optima...

Ayeni J. A., I. W., Olanrewaju S. S. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.