Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Probabilistic time-dependent vehicle routing problem

Probabilistic time-dependent vehicle routing problem 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Central European Journal of Operations Research Springer Journals

Loading next page...
 
/lp/springer_journal/probabilistic-time-dependent-vehicle-routing-problem-iKxTUjWoXQ

References (36)

Publisher
Springer Journals
Copyright
Copyright © 2016 by Springer-Verlag Berlin Heidelberg
Subject
Business and Management; Operations Research/Decision Theory
ISSN
1435-246X
eISSN
1613-9178
DOI
10.1007/s10100-016-0459-2
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Central European Journal of Operations ResearchSpringer Journals

Published: Oct 19, 2016

There are no references for this article.