About: Vehicle routing problem with a private fleet and common carriers - the variety with a possibility of sharing the satisfaction of demand

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Vehicle routing problem with a private fleet and common carriers - the variety with a possibility of sharing the satisfaction of demand Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. (en)
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 (en)
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 (en)
skos:notation	RIV/49777513:23510/13:43918969!RIV14-MSM-23510___
http://linked.open...avai/riv/aktivita	S
http://linked.open...avai/riv/aktivity	S
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Plevný, Miroslav
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Západočeská univerzita v Plzni / Fakulta ekonomická
http://linked.open...dnocenehoVysledku	113774
http://linked.open...ai/riv/idVysledku	RIV/49777513:23510/13:43918969
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	common carrier; private fleet; logistics; vehicle routing (en)
http://linked.open.../riv/klicoveSlovo	vehicle routing common carrier private fleet logistics
http://linked.open...ontrolniKodProRIV	[9AF3E9C5BEB3]
http://linked.open...v/mistoKonaniAkce	Jihlava
http://linked.open...i/riv/mistoVydani	Jihlava
http://linked.open...i/riv/nazevZdroje	Mathematical Methods in Economics 2013 : 31st international conference : proceedings
http://linked.open...in/vavai/riv/obor	BB
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Plevný, Miroslav
http://linked.open...vavai/riv/typAkce	EUR - Evropská
http://linked.open.../riv/zahajeniAkce	2013-09-11 (xsd:date)
number of pages	7 (xsd:int)
http://purl.org/ne...btex#hasPublisher	College of Polytechnics Jihlava
https://schema.org/isbn	978-80-87035-76-4
http://localhost/t...ganizacniJednotka	23510

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 16 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software