Vše

Co hledáte?

Vše
Projekty
Výsledky výzkumu
Subjekty

Rychlé hledání

  • Projekty podpořené TA ČR
  • Významné projekty
  • Projekty s nejvyšší státní podporou
  • Aktuálně běžící projekty

Chytré vyhledávání

  • Takto najdu konkrétní +slovo
  • Takto z výsledků -slovo zcela vynechám
  • “Takto můžu najít celou frázi”

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

Identifikátory výsledku

  • Kód výsledku v IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F26%3A0201668" target="_blank" >RIV/00216305:26210/26:0201668 - isvavai.cz</a>

  • Výsledek na webu

    <a href="https://ieeexplore.ieee.org/abstract/document/11224009" target="_blank" >https://ieeexplore.ieee.org/abstract/document/11224009</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/TCYB.2025.3625095" target="_blank" >10.1109/TCYB.2025.3625095</a>

Alternativní jazyky

  • Jazyk výsledku

    angličtina

  • Název v původním jazyce

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

  • Popis výsledku v původním jazyce

    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.

  • Název v anglickém jazyce

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

  • Popis výsledku anglicky

    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.

Klasifikace

  • Druh

    J<sub>imp</sub> - Článek v periodiku v databázi Web of Science

  • CEP obor

  • OECD FORD obor

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Návaznosti výsledku

  • Projekt

    <a href="/cs/project/GA24-12474S" target="_blank" >GA24-12474S: Benchmarking globálních optimalizačních metod</a><br>

  • Návaznosti

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Ostatní

  • Rok uplatnění

    2026

  • Kód důvěrnosti údajů

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Údaje specifické pro druh výsledku

  • Název periodika

    IEEE Transactions on Cybernetics

  • ISSN

    2168-2267

  • e-ISSN

    2168-2275

  • Svazek periodika

    56

  • Číslo periodika v rámci svazku

    3

  • Stát vydavatele periodika

    US - Spojené státy americké

  • Počet stran výsledku

    14

  • Strana od-do

    1202-1215

  • Kód UT WoS článku

    001612903100001

  • EID výsledku v databázi Scopus

    2-s2.0-105020878186