Selection Hyper-Heuristic Using a Portfolio of Derivative Heuristics

Kód výsledku v 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>

Nalezeny alternativní kódy

RIV/68407700:21730/15:00231785

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Selection Hyper-Heuristic Using a Portfolio of Derivative Heuristics

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Selection Hyper-Heuristic Using a Portfolio of Derivative Heuristics

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

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ů

Název statě ve sborníku

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

—

Počet stran výsledku

2

Strana od-do

1401-1402

Název nakladatele

ACM

Místo vydání

New York

Místo konání akce

Madrid

Datum konání akce

11. 7. 2015

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—