Corpus ID: 237489773

Probabilistic Analysis of Euclidean Capacitated Vehicle Routing

  title={Probabilistic Analysis of Euclidean Capacitated Vehicle Routing},
  author={Claire Mathieu and Hang Zhou},
  • C. Mathieu, Hang Zhou
  • Published 14 September 2021
  • Computer Science
  • ArXiv
We give a probabilistic analysis of the unit-demand Euclidean capacitated vehicle routing problem in the random setting, where the input distribution consists of n unit-demand customers modeled as independent, identically distributed uniform random points in the two-dimensional plane. The objective is to visit every customer using a set of routes of minimum total length, such that each route visits at most k customers, where k is the capacity of a vehicle. All of the following results are in… 

Figures from this paper


Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
We analyze the unit-demand Euclidean vehicle routeing problem, where n customers are modeled as independent, identically distributed uniform points and have unit demand. We show new lower bounds on
Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem
A heuristics which first clusters customers around the nearest depot and then does the TSP routing is shown to find an optimal tour almost surely, which decay as fast as $(1+\lambda)^{-\frac{1}{2}}$.
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.
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.
PTAS for the Euclidean Capacitated Vehicle Routing Problem in R^d
This paper proposes an EPTAS for the Euclidean CVRP for any fixed dimension and aims to bridge the gap between the proposed PTAS and the known results on how to solve the combinatorial problem of capacitated vehicle routing.
PTAS for k-tour cover problem on the plane for moderately large values of k
A novel reduction of the k-tour cover problem with a set of n points to a small set of instances of the problem, each with circle divide((k/epsilon)(circle divide(1))) points.
The Distance Traveled to Visit N Points with a Maximum of C Stops per Vehicle: An Analytic Model and an Application
  • C. Daganzo
  • Engineering, Computer Science
    Transp. Sci.
  • 1984
A simple formula to predict the distance traveled by fleets of vehicles in physical distribution problems involving a depot and its area of influence is developed.
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
  • R. Karp
  • Mathematics, Computer Science
    Math. Oper. Res.
  • 1977
This work considers partitioning algorithms for the approximate solution of large instances of the traveling-salesman problem in the plane, in which partitioning is used in conjunction with existing heuristic algorithms.
Vehicle routing with pick-up and delivery: tour-partitioning heuristics
Abstract Many applications of the classical vehicle routing problem involve pick-up and delivery services between the depot and peripheral locations (warehouses, stores, stations). This paper studies
Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
We consider the multidepot capacitated vehicle routing problems and analyze the tour partitioning heuristics for different versions of the model. We prove that the worst-case ratios of the heuristics