Jul 2026· Annual Conference on Genetic and Evolutionary Computation· pp. 41-49· 1 citation· 35 references
Computer Science
TL;DR
This work proposes a framework for designing both single- and multi-objective benchmark problems with identifiable local optima and controllable landscape features and implies that the landscape features of single-objective MSG landscapes are inherited in multi-objective extensions.
Abstract
The number and arrangement of local optima are crucial for evaluating the exploration-exploitation balance and the ability to discover promising local optima. However, existing benchmark suites rarely provide explicitly defined multi-modal landscapes, especially in multi-objective optimization. To bridge this gap, we propose a framework for designing both single- and multi-objective benchmark problems with identifiable local optima and controllable landscape features. Our approach builds on Max-Set of Gaussians (MSG) landscapes and extends them to the multi-objective domain. To match target landscape features, we optimize Gaussian heights and variances. Empirical results demonstrate that the framework can emulate several function classes from the Black-Box Optimization Benchmarking (BBOB) suite, including separable, multimodal, and ill-conditioned functions. Furthermore, we confirm that the framework can generate problems with Exploratory Landscape Analysis (ELA) feature patterns that are not present in the BBOB suite. Our results also imply that the landscape features of single-objective MSG landscapes are inherited in multi-objective extensions.
Mo-LON/D, a decomposition-based local optima network model for multi-objective landscapes, is introduced, indicating that mo-LON/D offers comparable explanatory power (and even higher correlations) with respect to the performance of state-of-the-art algorithms.
Gabriela Ochoa, Quentin Renau, Arnaud Liefooghe et al.· Annual Conference on Genetic...· 0 citations
Large Language Models (LLMs) are opening new directions for automated heuristic design (AHD), allowing evolutionary methods to create and enhance heuristics for constrained optimization problems (COPs). However, most existing approaches face the challenge of the exploration-exploitation balance, where the evolution nee...
Nam Do Khanh, Nhat Nguyen Tran Minh, Dat Pham Vu Tuan et al.· Proceedings of the Genetic a...· 1 citation
Results show that integrating local search significantly enhances performance, while a principled method for setting hybrid parameters ensures robustness and reproducibility, highlighting the potential of combining mathematical programming techniques with evolutionary algorithms for high-dimensional many-objective opti...
Regina C. L. C. de Sousa, Dênis E. C. Vargas, Elizabeth F. Wanner et al.· Journal of Heuristics· 0 citations
BONO-Bench is presented, a recently proposed problem generator and benchmark set for bi-objective numerical optimization that enables best practices for empirical runtime analysis of optimizers using reference solutions that can be approximated to an arbitrary degree, resulting in precise target values for the hypervol...
Lennart Schäpermeier, P. Kerschke· Proceedings of the Genetic a...· 0 citations
This work introduces a suite of synthetic multi-objective test problems with analytically controlled Pareto fronts and deliberately uninformative objective values, designed to decouple algorithmic behaviour from problem structure, allowing bias induced purely by algorithmic operators and design choices to be observed.
Jakub Kůdela, Niki van Stein, T. Bäck et al.· Annual Conference on Genetic...· 0 citations
This study introduces a standardized framework based on a Normalized Positional Diversity Index (D*) to quantify optimizer behaviour and demonstrates that D* is a geometric generalization of existing measures, by replacing stochastic, path-dependent historical maximums with a fixed global upper bound anchored to the se...
Said Gani, A. Bhat· GECCO Companion· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.