Comparison of Metaheuristic Optimization Algorithms in the Solution of Risk Optimization Problems

Abstract Risk optimization, also known as life-cycle cost and risk optimization, is a comprehensive stochastic approach that minimizes expected total costs by incorporating failure probabilities directly into the objective function. Despite its robustness, the formulation faces significant computational challenges due to the multidisciplinary nature of engineering systems and the complexities of rare-event reliability analysis. Crucially, computing these failure probabilities often relies on numerical methods, such as Monte Carlo simulation, which introduces inherent stochastic noise into the objective function and creates a highly rugged search landscape. This study benchmarks 10 metaheuristic methods—including particle swarm optimization, ant colony optimization, and genetic algorithms—across six representative problems of varying dimensionality (scaling up to a 20-variable structural benchmark) and time-dependency to identify the most effective strategies for this domain. The results reveal a distinct performance hierarchy, with ant colony optimization and the firefly algorithm emerging as the superior methods, closely followed by particle swarm optimization as a highly competitive alternative. These top-performing algorithms demonstrated exceptional convergence and high statistical stability, likely due to their mechanisms for collective reinforcement and momentum, which serve as numerical filters against the aforementioned stochastic noise. Conversely, methods such as simulated annealing, genetic algorithms, and invasive weed optimization showed limited applicability, characterized by high result variability and difficulty in navigating risk optimization search landscapes. Finally, when evaluating practical utility, methods including ant colony optimization, artificial bee colony, and teaching-learning-based optimization proved exceptionally robust. While the number of search agents must be scaled proportionally to problem size, these algorithms delivered consistent solutions using standard literature parameters without requiring time-consuming, problem-specific calibration. This inherent robustness distinguishes them from more sensitive heuristics and highlights their practical utility for complex engineering applications where extensive parameter tuning is computationally prohibitive.

Authors

Institutions

Publication Details

Journal
ASCE-ASME Journal of Risk and Uncertainty in Engineering Systems Part A Civil Engineering
Published
2026-11-12
DOI
https://doi.org/10.1061/ajrua6.rueng-2050
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Comparison of Metaheuristic Optimization Algorithms in the Solution of Risk Optimization Problems

Henrique Machado Kroetz, Dayanne Jéssica de Oliveira Czpak
ASCE-ASME Journal of Risk and Uncertainty in Engineering Systems Part A Civil Engineering
Metaheuristic Optimization Algorithms Research
article

Comparison of Metaheuristic Optimization Algorithms in the Solution of Risk Optimization Problems

Henrique Machado Kroetz, Dayanne Jéssica de Oliveira Czpak
article en

Abstract

Abstract Risk optimization, also known as life-cycle cost and risk optimization, is a comprehensive stochastic approach that minimizes expected total costs by incorporating failure probabilities directly into the objective function. Despite its robustness, the formulation faces significant computational challenges due to the multidisciplinary nature of engineering systems and the complexities of rare-event reliability analysis. Crucially, computing these failure probabilities often relies on numerical methods, such as Monte Carlo simulation, which introduces inherent stochastic noise into the objective function and creates a highly rugged search landscape. This study benchmarks 10 metaheuristic methods—including particle swarm optimization, ant colony optimization, and genetic algorithms—across six representative problems of varying dimensionality (scaling up to a 20-variable structural benchmark) and time-dependency to identify the most effective strategies for this domain. The results reveal a distinct performance hierarchy, with ant colony optimization and the firefly algorithm emerging as the superior methods, closely followed by particle swarm optimization as a highly competitive alternative. These top-performing algorithms demonstrated exceptional convergence and high statistical stability, likely due to their mechanisms for collective reinforcement and momentum, which serve as numerical filters against the aforementioned stochastic noise. Conversely, methods such as simulated annealing, genetic algorithms, and invasive weed optimization showed limited applicability, characterized by high result variability and difficulty in navigating risk optimization search landscapes. Finally, when evaluating practical utility, methods including ant colony optimization, artificial bee colony, and teaching-learning-based optimization proved exceptionally robust. While the number of search agents must be scaled proportionally to problem size, these algorithms delivered consistent solutions using standard literature parameters without requiring time-consuming, problem-specific calibration. This inherent robustness distinguishes them from more sensitive heuristics and highlights their practical utility for complex engineering applications where extensive parameter tuning is computationally prohibitive.

ASCE-ASME Journal of Risk and Uncertainty in Engineering Systems Part A Civil EngineeringVol. 13(1)
Universidade Tecnológica Federal do Paraná (BR), Universidade Federal do Paraná (BR)
Metaheuristic Optimization Algorithms Research
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.

Laika access coming soon