All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Probabilistic Time-Dependent Vehicle Routing Problem

The result's identifiers

  • Result code in 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>

  • Alternative codes found

    RIV/61989100:27740/15:86094054

  • Result on the web

    <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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Probabilistic Time-Dependent Vehicle Routing Problem

  • Original language description

    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

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

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

Others

  • Publication year

    2015

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    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

  • Number of pages

    6

  • Pages from-to

    149-154

  • Publisher name

    Slovenian Society Informatika

  • Place of publication

    Ljubljana

  • Event location

    Bled

  • Event date

    Sep 23, 2015

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article