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

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

Namespace Prefixes

PrefixIRI
n10http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n11http://localhost/temp/predkladatel/
n9http://purl.org/net/nknouf/ns/bibtex#
n21http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n15http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F14%3A00219995%21RIV15-MSM-21230___/
n17http://linked.opendata.cz/ontology/domain/vavai/
n19https://schema.org/
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/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F14%3A00219995%21RIV15-MSM-21230___
rdf:type
skos:Concept n17:Vysledek
rdfs:seeAlso
http://artax.karlin.mff.cuni.cz/~bajel3am/itat2014/local/38_Hruska.pdf
dcterms:description
This work proposes a genetic programming approach for producing an improved Clarke-Wright savings algorithm (CW) for solving capacitated vehicle routing problem (CVRP). CW is a very popular and fast low-level constructive heuristic which uses saving value, defined between each pair of two cities, to construct solutions for CVRP. The main idea of the proposed approach is to use genetic programming (GP) for evolving new mathematical functions for calculating the saving between each pair of cities. CW algorithm with the evolved function is tested on BranchAndCut VRP benchmarks. The results are promising and show improvement on the more than half of test instances. This work proposes a genetic programming approach for producing an improved Clarke-Wright savings algorithm (CW) for solving capacitated vehicle routing problem (CVRP). CW is a very popular and fast low-level constructive heuristic which uses saving value, defined between each pair of two cities, to construct solutions for CVRP. The main idea of the proposed approach is to use genetic programming (GP) for evolving new mathematical functions for calculating the saving between each pair of cities. CW algorithm with the evolved function is tested on BranchAndCut VRP benchmarks. The results are promising and show improvement on the more than half of test instances.
dcterms:title
Improving Clarke-Wright Algorithm with Genetic Programming Improving Clarke-Wright Algorithm with Genetic Programming
skos:prefLabel
Improving Clarke-Wright Algorithm with Genetic Programming Improving Clarke-Wright Algorithm with Genetic Programming
skos:notation
RIV/68407700:21230/14:00219995!RIV15-MSM-21230___
n3:aktivita
n20:S
n3:aktivity
S
n3:dodaniDat
n8:2015
n3:domaciTvurceVysledku
n21:1775022 n21:4199146
n3:druhVysledku
n16:D
n3:duvernostUdaju
n6:S
n3:entitaPredkladatele
n15:predkladatel
n3:idSjednocenehoVysledku
20997
n3:idVysledku
RIV/68407700:21230/14:00219995
n3:jazykVysledku
n13:eng
n3:klicovaSlova
Hyper-Heuristics; Genetic Programming; Clarke-Wright Savings Algorithm
n3:klicoveSlovo
n5:Clarke-Wright%20Savings%20Algorithm n5:Genetic%20Programming n5:Hyper-Heuristics
n3:kontrolniKodProRIV
[C46BF51B968D]
n3:mistoKonaniAkce
Demänovská Dolina
n3:mistoVydani
Praha
n3:nazevZdroje
Proceedings of the 14th conference ITAT 2014 – Workshops and Posters
n3:obor
n18:JC
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:rokUplatneniVysledku
n8:2014
n3:tvurceVysledku
Kubalík, Jiří Hruška, František
n3:typAkce
n10:WRD
n3:zahajeniAkce
2014-09-25+02:00
s:numberOfPages
6
n9:hasPublisher
Ústav informatiky AV ČR
n19:isbn
978-80-87136-19-5
n11:organizacniJednotka
21230