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%2F17%3A86098877" target="_blank" >RIV/61989100:27240/17:86098877 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/17:86098877

Výsledek na webu

<a href="http://link.springer.com/article/10.1007%2Fs10100-016-0459-2" target="_blank" >http://link.springer.com/article/10.1007%2Fs10100-016-0459-2</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s10100-016-0459-2" target="_blank" >10.1007/s10100-016-0459-2</a>

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

The probabilistic time-dependent vehicle routing problem is presented in this paper. It is a novel variant of the vehicle routing problem. The variant is a problem of finding optimal routes for a fleet of vehicles visiting customers in order to proceed delivery or pick-up. All customers must be visited in designated times with given probabilities and services must begin within the given time windows. Each vehicle has a given capacity, which must not be exceeded. The travel time between each two locations is dependent on a vehicle departure time. The paper also contains examples and solution results of testing data sets using the adaptive large neighbourhood search algorithm. © 2016 Springer-Verlag Berlin Heidelberg

Název v anglickém jazyce

Probabilistic time-dependent vehicle routing problem

Popis výsledku anglicky

The probabilistic time-dependent vehicle routing problem is presented in this paper. It is a novel variant of the vehicle routing problem. The variant is a problem of finding optimal routes for a fleet of vehicles visiting customers in order to proceed delivery or pick-up. All customers must be visited in designated times with given probabilities and services must begin within the given time windows. Each vehicle has a given capacity, which must not be exceeded. The travel time between each two locations is dependent on a vehicle departure time. The paper also contains examples and solution results of testing data sets using the adaptive large neighbourhood search algorithm. © 2016 Springer-Verlag Berlin Heidelberg

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>

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í

2017

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 periodika

Central European Journal of Operations Research

ISSN

1435-246X

e-ISSN

—

Svazek periodika

25

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

16

Strana od-do

1-16

Kód UT WoS článku

000407369000003

EID výsledku v databázi Scopus

2-s2.0-84991822085