86 search results - page 3 / 18 » Approximations for minimum and min-max vehicle routing probl... |
DISOPT
2006
14 years 9 months ago
2006
We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then...
HICSS
2005
IEEE
15 years 3 months ago
2005
IEEE
The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem in logistics. The problem is to serve a number of customers at minimum cost without violating the cus...
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
CORR
2010
Springer
14 years 9 months ago
2010
Springer
IOR
2006
14 years 9 months ago
2006
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...