Probabilistic Time-Dependent Vehicle Routing Problem

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F15%3A86094054" target="_blank" >RIV/61989100:27240/15:86094054 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/15:86094054

Výsledek na webu

<a href="http://www.fgg.uni-lj.si/~/sdrobne/sor/SOR'15%20-%20Proceedings.pdf" target="_blank" >http://www.fgg.uni-lj.si/~/sdrobne/sor/SOR'15%20-%20Proceedings.pdf</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Probabilistic Time-Dependent Vehicle Routing Problem

Popis výsledku v původním jazyce

Probabilistic Time-Dependent Vehicle Routing Problem is focused on logistic situations dealing with vehicle eets with limited load capacity and a set of customer requirements served by these sets with the minimum overall time of delivery for the whole request. Particular demands may be restricted by a defined time window and may have a set of probabilities of the delivery time fulfillment. The delivery time between customers or between a customer and a depot depends on the traveling distance, time of arrival and probability of the arrival time fulfillment for load delivery through each particular vehicle route. The paper presents a solution to the mentioned Probabilistic Time-Dependent Vehicle Routing Problem with the focus being on the individual setting of particular customer requests. This enables the specification of input parameters like a fixed guaranteed time for the selected requests with higher or lower importance defined by the probability level of its arrival time. This is a

Název v anglickém jazyce

Probabilistic Time-Dependent Vehicle Routing Problem

Popis výsledku anglicky

Probabilistic Time-Dependent Vehicle Routing Problem is focused on logistic situations dealing with vehicle eets with limited load capacity and a set of customer requirements served by these sets with the minimum overall time of delivery for the whole request. Particular demands may be restricted by a defined time window and may have a set of probabilities of the delivery time fulfillment. The delivery time between customers or between a customer and a depot depends on the traveling distance, time of arrival and probability of the arrival time fulfillment for load delivery through each particular vehicle route. The paper presents a solution to the mentioned Probabilistic Time-Dependent Vehicle Routing Problem with the focus being on the individual setting of particular customer requests. This enables the specification of input parameters like a fixed guaranteed time for the selected requests with higher or lower importance defined by the probability level of its arrival time. This is a

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

SOR '15 proceedings : the 13th International Symposium on Operations Research in Slovenia : Bled, Slovenia, September 23-25, 2015

ISBN

978-961-6165-45-7

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

149-154

Název nakladatele

Slovenian Society Informatika

Místo vydání

Ljubljana

Místo konání akce

Bled

Datum konání akce

23. 9. 2015

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—