Capacitated Vehicle Routing with Non-Uniform Speeds

  title={Capacitated Vehicle Routing with Non-Uniform Speeds},
  author={Inge Li G{\o}rtz and Marco S. Molinaro and Viswanath Nagarajan and Ramamoorthi Ravi},
The capacitated vehicle routing problem (CVRP) [21] involves distributing (identical) items from a depot to a set of demand locations in the shortest possible time, using a single capacitated vehicle. We study a generalization of this problem to the setting of multiple vehicles having non-uniform speeds (that we call Heterogenous CVRP), and present a constant-factor approximation algorithm. The technical heart of our result lies in achieving a constant approximation to the following TSP… 

Vehicle Routing with Subtours

A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem

This work considers a fundamental routing problem where there are two heterogeneous vehicles that start from distinct initial locations and a set of targets, and presents a primal-dual algorithm for this case that provides an approximation ratio of 2.5.

Approximation algorithms for regret minimization in vehicle routing problems

This thesis presents new approximation algorithms as well as hardness of approximation results for NP-hard vehicle routing problems related to public transportation, and describes an integer programming approach to solve School Bus problems in practice.

The Heterogeneous Capacitated k-Center Problem

One of the contributions is in relating the heterogeneous problem to special-cases of the classical santa-claus problem, and by designing new algorithms for these special cases, the following results are obtained.

A Scalable Multi-Robot Task Allocation Algorithm

A heuristic, called nearest-neighbor based Clustering And Routing $(nCAR)$, is presented, which has better execution time compared to the state-of-the-art heuristics and reduces cost of the solutions when there are a large number of nodes.

Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot Heterogeneous Traveling Salesman Problem

A 2-approximation algorithm based on the primal-dual method to solve a Multiple Depot Heterogeneous Traveling Salesman Problem where the cost of the traveling between any two targets depends on the type of the vehicle.

An approximation algorithm for vehicle routing with compatibility constraints

Approximation Algorithm for a Heterogeneous Vehicle Routing Problem

Computational results show that high quality solutions can be obtained for the path planning problem involving four vehicles and 40 targets using the proposed approach.

Persistent monitoring in discrete environments: Minimizing the maximum weighted latency between observations

This paper considers the problem of planning a path for a robot to monitor a known set of features of interest in an environment as a graph with vertex weights and edge lengths, and provides two approximation algorithms that can be applied to problems consisting of thousands of vertices.



Approximations for minimum and min-max vehicle routing problems

Vehicle Routing Problem

The vehicle routing problem with simultaneous deliveries and pickups (VRPSDP) has attracted much research interest because of the potential to provide cost savings to transportation and logistics

Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems

It is proved that there exists a constant ĉ > 0 such that the iterated tour partitioning heuristic given by Haimovich and Rinnooy Kan (1985) is a (2 - ĉ)-approximation algorithm with probability arbitrarily close to 1 as the number of customers goes to ∞.

A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing

A quasi-polynomial time approximation scheme for the setting where the customers and the depot are on the plane, and distances are given by the Euclidean metric.

Technical Note - Approximation Algorithms for VRP with Stochastic Demands

It is shown that the “cyclic heuristic” for split-delivery VRPSD achieves a constant approximation ratio, as conjectured in Bertsimas [Bertsimas, D. 1992.].

Bounds and Heuristics for Capacitated Routing Problems

Asymptotically optimal bounds and heuristics are developed for a capacitated routing problem that will find a solution with relative error at most (epsilon) in time polynomial in the number of customers.

Approximation Algorithms for VRP with Stochastic Demands

These bounds match the best known for even the respective deterministic problems [1, 2], and it is shown that the ‘cyclic heuristic’ for split-delivery VRPSD achieves a constant approximation ratio, as conjectured in [4].

Approximation algorithms for some routing problems

Several polynomial time approximation algorithms for some NP-complete routing problems are presented, and the worst-case ratios of the cost of the obtained route to that of an optimal are determined.

Technical Note - Heuristics for Delivery Problems with Constant Error Guarantees

In this paper Q Iterated Optimal Tour Partitioning, and Best Optimal Tour Partitioning algorithms are studied and analyzed for their worst case error. Both algorithms are based on partitioning an

Heuristics for unequal weight delivery problems with a fixed error guarantee