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

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

Namespace Prefixes

PrefixIRI
n13http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n18http://purl.org/net/nknouf/ns/bibtex#
n8http://localhost/temp/predkladatel/
n15http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/resource/domain/vavai/subjekt/
n11http://linked.opendata.cz/ontology/domain/vavai/
n9https://schema.org/
shttp://schema.org/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
n10http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F49777513%3A23510%2F13%3A43918969%21RIV14-MSM-23510___/
xsdhhttp://www.w3.org/2001/XMLSchema#
n21http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n19http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F49777513%3A23510%2F13%3A43918969%21RIV14-MSM-23510___
rdf:type
skos:Concept n11:Vysledek
dcterms:description
The delivery of goods from a depot to individual consumers is one of the most frequently solved problems in transport logistics. When the individual demands are smaller than the vehicle capacity, it is possible to formulate this task as the well-known vehicle routing problem. Apart from their private fleet of vehicles the managers may, in substantiated cases, consider using an external common carrier. This problem is called the vehicle routing problem with a private fleet and a common carrier (VRPPC) in the existing literature. The purpose of this contribution is to formulate a new variety of this problem, which is interesting from the point of practice and which was formulated on the basis of an authentic case of a local logistic firm. Let us suppose that it is possible to consider, with each individual customer, meeting his demand by means of one's own private fleet or by means of a common carrier, but also by sharing both these ways. In the contribution a mathematical model of this VRPPC variety has been developed. In the final part of the study a particular authentic example of the above problem and its prime solution by means of very simple heuristics is presented. The delivery of goods from a depot to individual consumers is one of the most frequently solved problems in transport logistics. When the individual demands are smaller than the vehicle capacity, it is possible to formulate this task as the well-known vehicle routing problem. Apart from their private fleet of vehicles the managers may, in substantiated cases, consider using an external common carrier. This problem is called the vehicle routing problem with a private fleet and a common carrier (VRPPC) in the existing literature. The purpose of this contribution is to formulate a new variety of this problem, which is interesting from the point of practice and which was formulated on the basis of an authentic case of a local logistic firm. Let us suppose that it is possible to consider, with each individual customer, meeting his demand by means of one's own private fleet or by means of a common carrier, but also by sharing both these ways. In the contribution a mathematical model of this VRPPC variety has been developed. In the final part of the study a particular authentic example of the above problem and its prime solution by means of very simple heuristics is presented.
dcterms:title
Vehicle routing problem with a private fleet and common carriers - the variety with a possibility of sharing the satisfaction of demand Vehicle routing problem with a private fleet and common carriers - the variety with a possibility of sharing the satisfaction of demand
skos:prefLabel
Vehicle routing problem with a private fleet and common carriers - the variety with a possibility of sharing the satisfaction of demand Vehicle routing problem with a private fleet and common carriers - the variety with a possibility of sharing the satisfaction of demand
skos:notation
RIV/49777513:23510/13:43918969!RIV14-MSM-23510___
n11:predkladatel
n12:orjk%3A23510
n5:aktivita
n21:S
n5:aktivity
S
n5:dodaniDat
n19:2014
n5:domaciTvurceVysledku
n15:3379701
n5:druhVysledku
n14:D
n5:duvernostUdaju
n6:S
n5:entitaPredkladatele
n10:predkladatel
n5:idSjednocenehoVysledku
113774
n5:idVysledku
RIV/49777513:23510/13:43918969
n5:jazykVysledku
n17:eng
n5:klicovaSlova
common carrier; private fleet; logistics; vehicle routing
n5:klicoveSlovo
n7:private%20fleet n7:vehicle%20routing n7:logistics n7:common%20carrier
n5:kontrolniKodProRIV
[9AF3E9C5BEB3]
n5:mistoKonaniAkce
Jihlava
n5:mistoVydani
Jihlava
n5:nazevZdroje
Mathematical Methods in Economics 2013 : 31st international conference : proceedings
n5:obor
n20:BB
n5:pocetDomacichTvurcuVysledku
1
n5:pocetTvurcuVysledku
1
n5:rokUplatneniVysledku
n19:2013
n5:tvurceVysledku
Plevný, Miroslav
n5:typAkce
n13:EUR
n5:zahajeniAkce
2013-09-11+02:00
s:numberOfPages
7
n18:hasPublisher
College of Polytechnics Jihlava
n9:isbn
978-80-87035-76-4
n8:organizacniJednotka
23510