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/
n18http://localhost/temp/predkladatel/
n6http://purl.org/net/nknouf/ns/bibtex#
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/resource/domain/vavai/subjekt/
n7http://linked.opendata.cz/ontology/domain/vavai/
n9https://schema.org/
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#
n12http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F60460709%3A41110%2F11%3A51203%21RIV14-MSM-41110___/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n17http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F60460709%3A41110%2F11%3A51203%21RIV14-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 difference is that the routes are paths (not cycles), i.e. vehicles do not return (or we do not mind how they return) to the central city. Costs are given for the straight routes between each pair of the cities and represent the time neces-sary for going through. Each path must not exceed a given time limit. The sum of time for all routes is to be minimized. For the exact definition see [8]. This problem is NP-hard. One of the possibilities how to solve the TLVRP is to use heuristics (approximation methods), and thus to obtain a sufficiently good solution. In this paper we have chosen three of these approximation methods, test them on some different instances and asses the performance of single heuristics depending on the number of vehicles necessary for currying out the desired transportation and number of cities on single routes. The time limited vehicle routing problem (TLVRP) stems from the vehicle routing problem. The main difference is that the routes are paths (not cycles), i.e. vehicles do not return (or we do not mind how they return) to the central city. Costs are given for the straight routes between each pair of the cities and represent the time neces-sary for going through. Each path must not exceed a given time limit. The sum of time for all routes is to be minimized. For the exact definition see [8]. This problem is NP-hard. One of the possibilities how to solve the TLVRP is to use heuristics (approximation methods), and thus to obtain a sufficiently good solution. In this paper we have chosen three of these approximation methods, test them on some different instances and asses the performance of single heuristics depending on the number of vehicles necessary for currying out the desired transportation and number of cities on single routes.
dcterms:title
Solution of the Time Limited Vehicle Routing Problem by Dif-ferent Approximation Methods Depending on the Number of Necessary Vehicles Solution of the Time Limited Vehicle Routing Problem by Dif-ferent Approximation Methods Depending on the Number of Necessary Vehicles
skos:prefLabel
Solution of the Time Limited Vehicle Routing Problem by Dif-ferent Approximation Methods Depending on the Number of Necessary Vehicles Solution of the Time Limited Vehicle Routing Problem by Dif-ferent Approximation Methods Depending on the Number of Necessary Vehicles
skos:notation
RIV/60460709:41110/11:51203!RIV14-MSM-41110___
n7:predkladatel
n8:orjk%3A41110
n3:aktivita
n4:S
n3:aktivity
S
n3:dodaniDat
n17:2014
n3:domaciTvurceVysledku
n14:4629922
n3:druhVysledku
n21:D
n3:duvernostUdaju
n13:S
n3:entitaPredkladatele
n16:predkladatel
n3:idSjednocenehoVysledku
230539
n3:idVysledku
RIV/60460709:41110/11:51203
n3:jazykVysledku
n19:eng
n3:klicovaSlova
time limited vehicle routing problem, vehicle routing problem, traveling salesman problem, heuristics (approximation method)
n3:klicoveSlovo
n12:time%20limited%20vehicle%20routing%20problem n12:traveling%20salesman%20problem n12:heuristics%20%28approximation%20method%29 n12:vehicle%20routing%20problem
n3:kontrolniKodProRIV
[8F704692B23F]
n3:mistoKonaniAkce
Janská Dolina
n3:mistoVydani
Praha
n3:nazevZdroje
29th International Conference on Mathematical Methods in Economics 2011
n3:obor
n15:BB
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:rokUplatneniVysledku
n17:2011
n3:tvurceVysledku
Kučera, Petr
n3:typAkce
n10:WRD
n3:wos
0
n3:zahajeniAkce
2011-09-06+02:00
s:numberOfPages
6
n6:hasPublisher
Professional Publishing
n9:isbn
978-80-7431-059-1
n18:organizacniJednotka
41110