Sciweavers

14 search results - page 2 / 3
» An Optimization-Based Heuristic for the Split Delivery Vehic...
Sort
View
AIR
2004
134views more  AIR 2004»
13 years 5 months ago
Combining Meta-Heuristics to Effectively Solve the Vehicle Routing Problems with Time Windows
The vehicle routing problems with time windows are challenging delivery problems in which instances involving 100 customers or more can be difficult to solve. There were many inter...
Vincent Tam, Keng Teck Ma
DISOPT
2006
118views more  DISOPT 2006»
13 years 5 months ago
Improved bounds for vehicle routing solutions
We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then...
Agustín Bompadre, Moshe Dror, James B. Orli...
EOR
2007
100views more  EOR 2007»
13 years 5 months ago
Designing delivery districts for the vehicle routing problem with stochastic demands
This paper considers the problem of designing districts for vehicle routing problems with stochastic demands. In particular, demands are assumed to be uncertain at the time when t...
Dag Haugland, Sin C. Ho, Gilbert Laporte