Improved bounds for vehicle routing solutions

Authors:
AgustíN Bompadre;Moshe Dror;James B. Orlin
Affiliations:
Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA 02139, United States;Department of Management Information Systems, Eller College of Management, University of Arizona, Tucson, AZ 85721-0108, United States;Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA 02139, United States
Venue:
Discrete Optimization
Year:
2006

Citing 7
Cited 1

Introduction to algorithms

Introduction to algorithms
Faster scaling algorithms for general graph matching problems

Journal of the ACM (JACM)
Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Polynomial time approximation schemes for Euclidean TSP and other geometric problems

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Heuristics for unequal weight delivery problems with a fixed error guarantee

Operations Research Letters

Technical Note---Approximation Algorithms for VRP with Stochastic Demands

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.