All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Fitness landscape analysis of hyper-heuristic transforms for the vertex cover problem

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10333621" target="_blank" >RIV/00216208:11320/16:10333621 - isvavai.cz</a>

  • Result on the web

    <a href="http://ceur-ws.org/Vol-1649/179.pdf" target="_blank" >http://ceur-ws.org/Vol-1649/179.pdf</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Fitness landscape analysis of hyper-heuristic transforms for the vertex cover problem

  • Original language description

    Hyper-heuristics have recently proved efficient in several areas of combinatorial search and optimiza- tion, especially scheduling. The basic idea of hyper- heuristics is based on searching for search-strategy. In- stead of traversing the solution-space, the hyper-heuristic traverses the space of algorithms to find or construct an algorithm best suited for the given problem instance. The observed efficiency of hyper-heuristics is not yet fully ex- plained on the theoretical level. The leading hypothesis suggests that the fitness landscape of the algorithm-space is more favorable to local search techniques than the orig- inal space. In this paper, we analyse properties of fitness landscapes of the problem of minimal vertex cover. We focus on prop- erties that are related to efficiency of metaheuristics such as locality and fitness-distance correlation. We compare properties of the original space and the algorithm space trying to verify the hypothesis explaining hyper-heuristics performance. Our analysis shows that the hyper-heuristic- space really has some more favorable properties than the original space.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2016

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Proceedings of the 16th ITAT Conference Information Technologies - Applications and Theory

  • ISBN

  • ISSN

    1613-0073

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    179-186

  • Publisher name

    CEUR-WS

  • Place of publication

    Neuveden

  • Event location

    Tatranské Matliare, Slovakia

  • Event date

    Sep 15, 2016

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article