Surrogate-Assisted Slime Mould Algorithm Considering a Dual-Based Merit Criterion for Global Database Management

Metaheuristic algorithms, including evolutionary approaches, are vital for solving non-trivial and non-convex optimization problems. However, real-world engineering often involves high-dimensional, expensive problems that deteriorate performance due to the substantial amount of required fitness evaluations. To address this, a growing trend utilizes evolutionary algorithms assisted by surrogate models, which limit the computational burden by providing alternatives to expensive evaluations. Leveraging the exploration capabilities of the recently developed Slime Mould Algorithm—a metaheuristic with only one tuning parameter that ignores personal best information—this work develops its surrogate-assisted counterpart: the Surrogate-Assisted Slime Mould Algorithm (SASMA). This new approach features an original database management strategy and surrogate building mechanism. To confirm its effectiveness and versatility, SASMA is tested on benchmark mathematical functions for 30 and 100 dimensions, as well as a classical truss design problem, against several surrogate-assisted and metaheuristic algorithms. The proposed SASMA achieved statistically significant improvements in both case studies, outperforming the selected benchmark algorithms on most test functions.

Authors

Institutions

Publication Details

Journal
Algorithms
Published
2026-04-01
DOI
https://doi.org/10.3390/a19040265
Primary Topic
Advanced Multi-Objective Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Surrogate-Assisted Slime Mould Algorithm Considering a Dual-Based Merit Criterion for Global Database Management

S.J.P.S. Mariano, José Pombo, Pedro Bento, Hugo Nunes et al.
Algorithms
Advanced Multi-Objective Optimization Algorithms
article

Surrogate-Assisted Slime Mould Algorithm Considering a Dual-Based Merit Criterion for Global Database Management

S.J.P.S. Mariano, José Pombo, Pedro Bento, Hugo Nunes, Maria Calado
article en

Abstract

Metaheuristic algorithms, including evolutionary approaches, are vital for solving non-trivial and non-convex optimization problems. However, real-world engineering often involves high-dimensional, expensive problems that deteriorate performance due to the substantial amount of required fitness evaluations. To address this, a growing trend utilizes evolutionary algorithms assisted by surrogate models, which limit the computational burden by providing alternatives to expensive evaluations. Leveraging the exploration capabilities of the recently developed Slime Mould Algorithm—a metaheuristic with only one tuning parameter that ignores personal best information—this work develops its surrogate-assisted counterpart: the Surrogate-Assisted Slime Mould Algorithm (SASMA). This new approach features an original database management strategy and surrogate building mechanism. To confirm its effectiveness and versatility, SASMA is tested on benchmark mathematical functions for 30 and 100 dimensions, as well as a classical truss design problem, against several surrogate-assisted and metaheuristic algorithms. The proposed SASMA achieved statistically significant improvements in both case studies, outperforming the selected benchmark algorithms on most test functions.

AlgorithmsVol. 19(4)
University of Beira Interior (PT), Instituto de Telecomunicações (PT)
Industry, innovation and infrastructure
Openalex Percentile: Top 30%
Advanced Multi-Objective Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.