Sciweavers

116 search results - page 4 / 24
» Dynamic pickup and delivery problems
Sort
View
DAM
2011
13 years 2 months ago
An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays
This paper considers a single-vehicle Dial-a-Ride problem in which customers may experience stochastic delays at their pickup locations. If a customer is absent when the vehicle s...
Géraldine Heilporn, Jean-François Co...
DAM
2008
78views more  DAM 2008»
13 years 8 months ago
Semi-preemptive routing on trees
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
Sven Oliver Krumke, Dirk Räbiger, Rainer Schr...
IOR
2006
173views more  IOR 2006»
13 years 7 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
COR
2010
152views more  COR 2010»
13 years 8 months ago
Variable neighborhood search for the dial-a-ride problem
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...
Sophie N. Parragh, Karl F. Doerner, Richard F. Har...
EOR
2008
119views more  EOR 2008»
13 years 8 months ago
A General Vehicle Routing Problem
In this paper we study a rich vehicle routing problem incorporating various complexities found in real-life applications. The General Vehicle Routing Problem (GVRP) is a combined ...
Asvin Goel, Volker Gruhn