Sciweavers

65 search results - page 1 / 13
» Reachability cuts for the vehicle routing problem with time ...
Sort
View
TRANSCI
2002
57views more  TRANSCI 2002»
13 years 5 months ago
A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
Jonathan F. Bard, George Kontoravdis, Gang Yu
IOR
2006
173views more  IOR 2006»
13 years 5 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
EUSFLAT
2003
128views Fuzzy Logic» more  EUSFLAT 2003»
13 years 6 months ago
Planning time restricted logistic tours with fuzzy logic
We present a modification of the vehicle routing problem with the additional restriction that time windows are associated with each customer by defining an interval wherein the cu...
Alexander Holland