Showing 2024Show all
3 papers · 1 filter
cs.NE2024
MO-IOHinspector: Anytime Benchmarking of Multi-Objective Algorithms using IOHprofiler
Diederick Vermetten, Jeroen Rook, Oliver L. Preuà +5
Benchmarking is one of the key ways in which we can gain insight into the strengths and weaknesses of optimization algorithms. In sampling-based optimization, considering the anyti…
cs.NE2024
CGP++ : A Modern C++ Implementation of Cartesian Genetic Programming
Roman Kalkreuth, Thomas Baeck
The reference implementation of Cartesian Genetic Programming (CGP) was written in the C programming language. C inherently follows a procedural programming paradigm, which entails…
cs.NE2024
Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem
Saba Sadeghi Ahouei, Jacob de Nobel, Aneta Neumann +2
Chance-constrained problems involve stochastic components in the constraints which can be violated with a small probability. We investigate the impact of different types of chance…