Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

DISOPT
2006

favoriteEmaildiscussreport

118views more DISOPT 2006»

Improved bounds for vehicle routing solutions

13 years 4 months ago

Improved bounds for vehicle routing solutions

Download www.its.caltech.edu

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 utilized in a design of best-to-date approximation algorithms. Key words: Vehicle routing problem, Lower bound, Approximation algorithm

Agustín Bompadre, Moshe Dror, James B. Orli

Real-time Traffic

Approximation Algorithm | DISOPT 2006 | Lower Bound | Vehicle Routing Problem |

claim paper

Related Content

» New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery

» A General Vehicle Routing Problem

» Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem

» An improved multiobjective evolutionary algorithm for the vehicle routing problem with tim...

» Arcsstates models for the vehicle routing problem with time windows and related problems

» Randomized Adaptive Spatial Decoupling for LargeScale Vehicle Routing with Time Windows

» The multishift vehicle routing problem with overtime

» Ant colony optimization techniques for the vehicle routing problem

» A general heuristic for vehicle routing problems

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	DISOPT
Authors	Agustín Bompadre, Moshe Dror, James B. Orlin

Comments (0)