15 search results - page 2 / 3 » New Lower Bounds for the Vehicle Routing Problem with Simult... |
CISIS
2011
IEEE
12 years 5 months ago
2011
IEEE
—The Dynamic Vehicle Routing Problem (DVRP) is an optimization problem in which agents deliver orders that are not known in advance to the routing. Partial solutions need to be a...
DISOPT
2006
13 years 5 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...
IOR
2006
13 years 5 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...
ENDM
2010
12 years 12 months ago
2010
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 ...
COR
2010
13 years 5 months ago
2010
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...