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%2F17%3A86098877" target="_blank" >RIV/61989100:27240/17:86098877 - isvavai.cz</a>
Alternative codes found
RIV/61989100:27740/17:86098877
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Probabilistic time-dependent vehicle routing problem
Original language description
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
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2017
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
Name of the periodical
Central European Journal of Operations Research
ISSN
1435-246X
e-ISSN
—
Volume of the periodical
25
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
16
Pages from-to
1-16
UT code for WoS article
000407369000003
EID of the result in the Scopus database
2-s2.0-84991822085