Sciweavers

38 search results - page 1 / 8
» The Vehicle Routing Problem with Demand Range
Sort
View
ANOR
2006
81views more  ANOR 2006»
13 years 5 months ago
The Vehicle Routing Problem with Demand Range
We propose and formulate the vehicle routing problem with demand range (VRPDR), a new variation on the traditional vehicle routing problem. In the VRPDR, the delivery quantity for ...
Ann Melissa Campbell
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
COR
2010
155views more  COR 2010»
13 years 5 months ago
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...
Jorge E. Mendoza, Bruno Castanier, Christelle Gu&e...
TRANSCI
2010
98views more  TRANSCI 2010»
13 years 4 hour ago
The Vehicle Routing Problem with Stochastic Demand and Duration Constraints
Time considerations have been largely ignored in the study of vehicle routing problems with stochastic demands, even though they are crucial in practice. We show that tour duratio...
Alan L. Erera, Juan C. Morales, Martin W. P. Savel...
ANOR
2005
120views more  ANOR 2005»
13 years 5 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello