Two Novel Instance Selection Methods Combining Algorithm Performance and Landscape Analysis: A Comparative Study in Continuous Optimization

A reliable benchmark library is essential for advancing research in global optimization by enabling fair comparisons and rigorous testing of optimization algorithms across diverse problem landscapes. In this article, we focus on instance selection methods, which aim to choose representative problems...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on cybernetics Ročník PP; s. 1 - 14
Hlavní autoři: Stripinis, Linas, Kudela, Jakub, Paulavicius, Remigijus
Médium: Journal Article
Jazyk:angličtina
Vydáno: United States IEEE 03.11.2025
Témata:
Algorithm performance
Benchmark testing
black-box global optimization
Cybernetics
Euclidean distance
exploratory landscape analysis
instance selection methods
Libraries
numerical benchmarking
Optimization
Reliability
Reviews
Runtime
Training
Vectors
ISSN:2168-2267, 2168-2275, 2168-2275
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A reliable benchmark library is essential for advancing research in global optimization by enabling fair comparisons and rigorous testing of optimization algorithms across diverse problem landscapes. In this article, we focus on instance selection methods, which aim to choose representative problems for evaluating algorithm performance. We present a comprehensive review of existing instance selection methods, highlighting their strengths and limitations, particularly in balancing the consideration of algorithm performance and the analysis of problem characteristics using exploratory landscape analysis. Building on these insights, we introduce two novel instance selection methods that leverage both algorithm performance data and landscape analysis information to construct diverse and informative benchmark sets. For evaluation, we benchmark our approaches against four existing instance selection methods on the recently expanded DIRECTGOLib v2.0 library. Our results demonstrate that the proposed methods effectively identify representative instances that capture a wide range of problem characteristics, enabling a more comprehensive evaluation of algorithm performance. These findings have significant implications for the development and assessment of new optimization algorithms, ultimately contributing to more reliable and robust solutions for real-world optimization problems.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:2168-2267
2168-2275
2168-2275
DOI:10.1109/TCYB.2025.3625095