This HTML5 document contains 39 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/
n9http://localhost/temp/predkladatel/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/resource/domain/vavai/subjekt/
n7http://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#
n15http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F60460709%3A41110%2F12%3A55968%21RIV13-MSM-41110___/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F60460709%3A41110%2F12%3A55968%21RIV13-MSM-41110___
rdf:type
skos:Concept n7:Vysledek
dcterms:description
The time limited vehicle routing problem (TLVRP) stems from the vehicle routing problem. The main diff erence is that the routes are paths (not cycles), i.e. vehicles do not return to the central city (or at least we do not observe their way back). Costs are given for the straight routes between each pair of the cities and represent the time necessary for going through. Each path must not exceed a given time limit. The sum of times for all routes is to be minimized. This problem is NP-hard. There are many various possibilities how to design the heuristics (approximation methods) to solve it. One of the ways of how to obtain an approximation method for the TLVRP is to modify the famous savings method by Clark and Wright (1964) for this purpose. In this paper we suggest several diff erent versions of this method, test them in some instances, and evaluate and mutually compare the results of individual versions. The time limited vehicle routing problem (TLVRP) stems from the vehicle routing problem. The main diff erence is that the routes are paths (not cycles), i.e. vehicles do not return to the central city (or at least we do not observe their way back). Costs are given for the straight routes between each pair of the cities and represent the time necessary for going through. Each path must not exceed a given time limit. The sum of times for all routes is to be minimized. This problem is NP-hard. There are many various possibilities how to design the heuristics (approximation methods) to solve it. One of the ways of how to obtain an approximation method for the TLVRP is to modify the famous savings method by Clark and Wright (1964) for this purpose. In this paper we suggest several diff erent versions of this method, test them in some instances, and evaluate and mutually compare the results of individual versions.
dcterms:title
DIFFERENT VERSIONS OF THE SAVINGS METHOD FOR THE TIME LIMITED VEHICLE ROUTING PROBLEM DIFFERENT VERSIONS OF THE SAVINGS METHOD FOR THE TIME LIMITED VEHICLE ROUTING PROBLEM
skos:prefLabel
DIFFERENT VERSIONS OF THE SAVINGS METHOD FOR THE TIME LIMITED VEHICLE ROUTING PROBLEM DIFFERENT VERSIONS OF THE SAVINGS METHOD FOR THE TIME LIMITED VEHICLE ROUTING PROBLEM
skos:notation
RIV/60460709:41110/12:55968!RIV13-MSM-41110___
n7:predkladatel
n8:orjk%3A41110
n3:aktivita
n18:S
n3:aktivity
S
n3:cisloPeriodika
7
n3:dodaniDat
n6:2013
n3:domaciTvurceVysledku
n4:4629922
n3:druhVysledku
n17:J
n3:duvernostUdaju
n10:S
n3:entitaPredkladatele
n15:predkladatel
n3:idSjednocenehoVysledku
131252
n3:idVysledku
RIV/60460709:41110/12:55968
n3:jazykVysledku
n16:eng
n3:klicovaSlova
time limited vehicle routing problem, vehicle routing problem, traveling salesman problem, savings
n3:klicoveSlovo
n5:time%20limited%20vehicle%20routing%20problem n5:traveling%20salesman%20problem n5:savings n5:vehicle%20routing%20problem
n3:kodStatuVydavatele
CZ - Česká republika
n3:kontrolniKodProRIV
[08D943321317]
n3:nazevZdroje
Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis
n3:obor
n14:BB
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:rokUplatneniVysledku
n6:2012
n3:svazekPeriodika
LX
n3:tvurceVysledku
Kučera, Petr
n3:wos
0
s:issn
1211-8516
s:numberOfPages
8
n9:organizacniJednotka
41110