A co-evolutionary meta-heuristic framework for dynamic constrained optimization problems

Abstract Dynamic constrained optimization problems (DCOPs) are optimization problems where both the problem landscape and the problem constraints change over time, or either the problem landscape or the constraints change. Although DCOPs represent the super-set of optimization problems, relatively little is understood about these problems due to the complexity added to the optimization process and few meta-heuristics exist for DCOPs. This paper proposes a co-evolutionary meta-heuristic framework to allow for easy integration of existing dynamic meta-heuristics developed to solve box-constrained dynamic optimization problems only, into the framework to produce new co-evolutionary versions of these dynamic meta-heuristics to solve various classes of DCOPs. The paper analyzes the performance of the resulting co-evolutionary versions of these existing dynamic meta-heuristics on a comprehensive set of DCOP benchmark problems, and shows that the performance of these dynamic co-evolutionary algorithms are the best performing among a number of evaluated meta-heuristics.

Authors

Institutions

Publication Details

Journal
Soft Computing
Published
2025-09-23
DOI
https://doi.org/10.1007/s00500-025-10873-9
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
article

A co-evolutionary meta-heuristic framework for dynamic constrained optimization problems

Andries Petrus Engelbrecht, Gary Pamparà
Soft Computing
Metaheuristic Optimization Algorithms Research
article

A co-evolutionary meta-heuristic framework for dynamic constrained optimization problems

Andries Petrus Engelbrecht, Gary Pamparà
article en

Abstract

Abstract Dynamic constrained optimization problems (DCOPs) are optimization problems where both the problem landscape and the problem constraints change over time, or either the problem landscape or the constraints change. Although DCOPs represent the super-set of optimization problems, relatively little is understood about these problems due to the complexity added to the optimization process and few meta-heuristics exist for DCOPs. This paper proposes a co-evolutionary meta-heuristic framework to allow for easy integration of existing dynamic meta-heuristics developed to solve box-constrained dynamic optimization problems only, into the framework to produce new co-evolutionary versions of these dynamic meta-heuristics to solve various classes of DCOPs. The paper analyzes the performance of the resulting co-evolutionary versions of these existing dynamic meta-heuristics on a comprehensive set of DCOP benchmark problems, and shows that the performance of these dynamic co-evolutionary algorithms are the best performing among a number of evaluated meta-heuristics.

Soft ComputingVol. 29(21-22)
Gulf University for Science & Technology (KW), Stellenbosch University (ZA)
Openalex Percentile: Top 86%
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.

A co-evolutionary meta-heuristic framework for dynamic constrained optimization problems — Andries Petrus Engelbrecht, Gary Pamparà · Soft Computing (2025) | TGRS Research Map | TGRS