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”

Selection Hyper-Heuristic Using a Portfolio of Derivative Heuristics

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00231785" target="_blank" >RIV/68407700:21230/15:00231785 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21730/15:00231785

  • Result on the web

    <a href="http://dl.acm.org/citation.cfm?id=2764686&CFID=715756301&CFTOKEN=65340477" target="_blank" >http://dl.acm.org/citation.cfm?id=2764686&CFID=715756301&CFTOKEN=65340477</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1145/2739482.2764686" target="_blank" >10.1145/2739482.2764686</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Selection Hyper-Heuristic Using a Portfolio of Derivative Heuristics

  • Original language description

    Generally, we distinguish two classes of hyper-heuristic approaches, heuristic selection and heuristic generation. The former one works with existing heuristics and tries to find their optimal order for solving the instance. The later approach automatically generates new heuristic. Here, these two approaches are combined so that, first, a number of various heuristics are derived from a limited set of pre-existing heuristics for the selected optimization problem with regard to the diversity among the heuristics. Then, the heuristic selection approach is used to find the optimal sequence of heuristics leading to the best solution. Proof-of-concept experiments on the Capacitated Vehicle Routing Problem were carried out with the well-known Clarke-Wright, Mole-Jameson and Kilby constructive heuristics. Results show that the derived heuristics produce consistently better results than the original ones.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JC - Computer hardware and software

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2015

  • 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 Companion Publication of the 2015 on Genetic and Evolutionary Computation Conference (GECCO 2015)

  • ISBN

    978-1-4503-3488-4

  • ISSN

  • e-ISSN

  • Number of pages

    2

  • Pages from-to

    1401-1402

  • Publisher name

    ACM

  • Place of publication

    New York

  • Event location

    Madrid

  • Event date

    Jul 11, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article