Sciweavers

33 search results - page 5 / 7
» Robust Branch-and-Cut-and-Price for the Capacitated Vehicle ...
Sort
View
COR
2006
99views more  COR 2006»
13 years 7 months ago
Waste collection vehicle routing problem with time windows
In this paper, we address a real life waste collection vehicle routing problem with time windows (VRPTW) with consideration of multiple disposal trips and drivers' lunch brea...
Byung-In Kim, Seongbae Kim, Surya Sahoo
NETWORKS
2008
13 years 7 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
MP
2006
79views more  MP 2006»
13 years 7 months ago
Projection results for vehicle routing
A variety of integer programming formulations have been proposed for Vehicle Routing Problems (VRPs), including the so-called two- and three-index formulations, the set partitioni...
Adam N. Letchford, Juan José Salazar Gonz&a...
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
14 years 2 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
TRANSCI
2010
98views more  TRANSCI 2010»
13 years 2 months 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...