This HTML5 document contains 46 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n7http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n24http://purl.org/net/nknouf/ns/bibtex#
n22http://localhost/temp/predkladatel/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n19http://linked.opendata.cz/resource/domain/vavai/subjekt/
n16http://linked.opendata.cz/ontology/domain/vavai/
n14https://schema.org/
n13http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
rdfshttp://www.w3.org/2000/01/rdf-schema#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n23http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F13%3A00213057%21RIV14-MSM-21230___/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n17http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F13%3A00213057%21RIV14-MSM-21230___
rdf:type
skos:Concept n16:Vysledek
rdfs:seeAlso
http://labe.felk.cvut.cz/~kubalik/publications/gecco2013_HyperheuristicForCVRP.pdf
dcterms:description
In this paper a novel constructive hyperheuristic for CVRP is proposed. This hyperheuristic, called HyperPOEMS, is based on an evolutionary-based iterative local search algorithm. Its inherent characteristics make it capable of autonomously searching a structured space of low-level domain specific heuristics for their suitable combinations that produce good solutions to particular problem instance. Hyper-POEMS was tested on standard benchmarks and compared to two existing constructive hyperheuristic, HHC-VRP and EHH-VRP. The results show that HyperPOEMS outperforms both compared hyperheuristics and produces solutions competitive to solutions obtained by specialized metaheuristics designed for CVRP. In this paper a novel constructive hyperheuristic for CVRP is proposed. This hyperheuristic, called HyperPOEMS, is based on an evolutionary-based iterative local search algorithm. Its inherent characteristics make it capable of autonomously searching a structured space of low-level domain specific heuristics for their suitable combinations that produce good solutions to particular problem instance. Hyper-POEMS was tested on standard benchmarks and compared to two existing constructive hyperheuristic, HHC-VRP and EHH-VRP. The results show that HyperPOEMS outperforms both compared hyperheuristics and produces solutions competitive to solutions obtained by specialized metaheuristics designed for CVRP.
dcterms:title
Evolutionary Hyperheuristic for Capacitated Vehicle Routing Problem Evolutionary Hyperheuristic for Capacitated Vehicle Routing Problem
skos:prefLabel
Evolutionary Hyperheuristic for Capacitated Vehicle Routing Problem Evolutionary Hyperheuristic for Capacitated Vehicle Routing Problem
skos:notation
RIV/68407700:21230/13:00213057!RIV14-MSM-21230___
n16:predkladatel
n19:orjk%3A21230
n3:aktivita
n12:S n12:Z
n3:aktivity
S, Z(MSM6840770038)
n3:dodaniDat
n17:2014
n3:domaciTvurceVysledku
n4:9668292 n4:1775022
n3:druhVysledku
n8:D
n3:duvernostUdaju
n15:S
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
73820
n3:idVysledku
RIV/68407700:21230/13:00213057
n3:jazykVysledku
n10:eng
n3:klicovaSlova
Hyper-Heuristics; Capacitated Vehicle Routing Problem; Combinatorial Optimization; Evolutionary Algorithms
n3:klicoveSlovo
n6:Capacitated%20Vehicle%20Routing%20Problem n6:Hyper-Heuristics n6:Combinatorial%20Optimization n6:Evolutionary%20Algorithms
n3:kontrolniKodProRIV
[893D0985072F]
n3:mistoKonaniAkce
Amsterdam
n3:mistoVydani
New York
n3:nazevZdroje
Genetic and Evolutionary Computation Conference - Companion Material Proceedings
n3:obor
n18:JC
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:rokUplatneniVysledku
n17:2013
n3:tvurceVysledku
Kubalík, Jiří Mlejnek, Jaromír
n3:typAkce
n7:WRD
n3:zahajeniAkce
2013-07-06+02:00
n3:zamer
n13:MSM6840770038
s:numberOfPages
2
n23:doi
10.1145/2464576.2464684
n24:hasPublisher
ACM
n14:isbn
978-1-4503-1964-5
n22:organizacniJednotka
21230