most citedModular Differential Evolution

1 citations · 2 across the 8 of their papers we have counts for

collaborators

8 papers

cs.NE2023

Representation-agnostic distance-driven perturbation for optimizing ill-conditioned problems

Kirill Antonov, Anna V. Kononova, Thomas Bäck +1

Locality is a crucial property for efficiently optimising black-box problems with randomized search heuristics. However, in practical applications, it is not likely to always find…

cs.NE2023

Challenges of ELA-guided Function Evolution using Genetic Programming

Fu Xing Long, Diederick Vermetten, Anna V. Kononova +4

Within the optimization community, the question of how to generate new optimization problems has been gaining traction in recent years. Within topics such as instance space analysi…

cs.NE2023

Analysis of modular CMA-ES on strict box-constrained problems in the SBOX-COST benchmarking suite

Diederick Vermetten, Manuel López-Ibáñez, Olaf Mersmann +2

Box-constraints limit the domain of decision variables and are common in real-world optimization problems, for example, due to physical, natural or spatial limitations. Consequentl…

cs.NE2023

Patterns of Convergence and Bound Constraint Violation in Differential Evolution on SBOX-COST Benchmarking Suite

Mădălina-Andreea Mitran, Anna V. Kononova, Fabio Caraffini +1

This study investigates the influence of several bound constraint handling methods (BCHMs) on the search process specific to Differential Evolution (DE), with a focus on identifyin…

cs.NE2023

When to be Discrete: Analyzing Algorithm Performance on Discretized Continuous Problems

André Thomaser, Jacob de Nobel, Diederick Vermetten +3

The domain of an optimization problem is seen as one of its most important characteristics. In particular, the distinction between continuous and discrete optimization is rather im…

cs.NE20231 cited

Modular Differential Evolution

Diederick Vermetten, Fabio Caraffini, Anna V. Kononova +1

New contributions in the field of iterative optimisation heuristics are often made in an iterative manner. Novel algorithmic ideas are not proposed in isolation, but usually as an…