188 search results - page 4 / 38 » Algorithms for Capacitated Vehicle Routing |
NETWORKS
2008
14 years 9 months ago
2008
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...
89
Voted
COR
2007
14 years 9 months ago
2007
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
73
Voted
EOR
2000
14 years 9 months ago
2000
In the capacitated arc routing problem with multiple centers (M-CARP) the objective is to
74
Voted
ESA
2009
Springer
15 years 4 months ago
2009
Springer
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,...
COR
2006
14 years 9 months ago
2006
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...