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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n13http://localhost/temp/predkladatel/
n18http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n17http://linked.opendata.cz/resource/domain/vavai/subjekt/
n16http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
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#
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F60460709%3A41110%2F13%3A62341%21RIV14-MSM-41110___/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F60460709%3A41110%2F13%3A62341%21RIV14-MSM-41110___
rdf:type
skos:Concept n16:Vysledek
dcterms:description
This paper presents a case study of a local brewery situated near to Prague. Even though its management already has the software which solves the vehicle routing problem by Mayer and Branch and Bound methods, it is still favourable to implement more approximation methods. The basic reason is that the Branch and Bound algorithm is complicated and software overflows may occur during its run in case of more cities in the cycle. The aim of this paper is to solve the real transportations using other methods that satisfy basic requirements of practicability. Transportation, which the brewery carried out during the selected week, provided data which were then analyzed using both the modifications of “classical” approximation methods (such as by Clark and Wright, Habr, and Mayer). Three types of the combination of these methods were also applied. The computed results were compared with the routes actually used by the brewery and with results from already implemented software. They showed that the brewery c This paper presents a case study of a local brewery situated near to Prague. Even though its management already has the software which solves the vehicle routing problem by Mayer and Branch and Bound methods, it is still favourable to implement more approximation methods. The basic reason is that the Branch and Bound algorithm is complicated and software overflows may occur during its run in case of more cities in the cycle. The aim of this paper is to solve the real transportations using other methods that satisfy basic requirements of practicability. Transportation, which the brewery carried out during the selected week, provided data which were then analyzed using both the modifications of “classical” approximation methods (such as by Clark and Wright, Habr, and Mayer). Three types of the combination of these methods were also applied. The computed results were compared with the routes actually used by the brewery and with results from already implemented software. They showed that the brewery c
dcterms:title
Contribution of simple heuristics for the vehicle routing problem – A case study of a small brewery Contribution of simple heuristics for the vehicle routing problem – A case study of a small brewery
skos:prefLabel
Contribution of simple heuristics for the vehicle routing problem – A case study of a small brewery Contribution of simple heuristics for the vehicle routing problem – A case study of a small brewery
skos:notation
RIV/60460709:41110/13:62341!RIV14-MSM-41110___
n16:predkladatel
n17:orjk%3A41110
n3:aktivita
n14:S
n3:aktivity
S
n3:cisloPeriodika
7
n3:dodaniDat
n6:2014
n3:domaciTvurceVysledku
n18:7344619 n18:4629922
n3:druhVysledku
n12:J
n3:duvernostUdaju
n9:S
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
66928
n3:idVysledku
RIV/60460709:41110/13:62341
n3:jazykVysledku
n15:eng
n3:klicovaSlova
vehicle routing problem, case study, Mayer method, savings method, Habr frequencies, methods crossing
n3:klicoveSlovo
n4:savings%20method n4:case%20study n4:methods%20crossing n4:Habr%20frequencies n4:Mayer%20method n4:vehicle%20routing%20problem
n3:kodStatuVydavatele
CZ - Česká republika
n3:kontrolniKodProRIV
[A05C1C7DFB81]
n3:nazevZdroje
Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis
n3:obor
n7:BB
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:rokUplatneniVysledku
n6:2013
n3:svazekPeriodika
LXI
n3:tvurceVysledku
Krejčí, Igor Kučera, Petr
n3:wos
0
s:issn
1211-8516
s:numberOfPages
9
n13:organizacniJednotka
41110