Sciweavers

209 search results - page 8 / 42
» The multi-depot vehicle routing problem with inter-depot rou...
Sort
View
88
Voted
HEURISTICS
2010
14 years 10 months ago
An adaptive memory algorithm for the split delivery vehicle routing problem
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill
EOR
2007
100views more  EOR 2007»
15 years 23 days 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
113
Voted
HEURISTICS
2002
146views more  HEURISTICS 2002»
15 years 18 days ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
112
Voted
ENDM
2010
118views more  ENDM 2010»
14 years 7 months ago
On the Vehicle Routing Problem with lower bound capacities
In this paper we show and discuss a family of inequalities for solving a variant of the classical vehicle routing problem where also a lower bound is considered. The inequalities ...
Luís Gouveia, Juan José Salazar Gonz...
119
Voted
JAL
2006
175views more  JAL 2006»
15 years 24 days ago
Approximations for minimum and min-max vehicle routing problems
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
Esther M. Arkin, Refael Hassin, Asaf Levin