Sciweavers

263 search results - page 10 / 53
» On a Labeled Vehicle Routing Problem
Sort
View
EOR
2007
100views more  EOR 2007»
14 years 9 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
79
Voted
IPPS
2007
IEEE
15 years 3 months ago
Parallel Tabu Search and the Multiobjective Vehicle Routing Problem with Time Windows
Abstract—In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with Time Windows (CV...
Andreas Beham
HEURISTICS
2002
146views more  HEURISTICS 2002»
14 years 9 months 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...
HEURISTICS
2010
14 years 6 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
85
Voted
ENDM
2010
118views more  ENDM 2010»
14 years 4 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...