A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs

The Capacitated Vehicle Routing problem is a generalization of the Traveling Salesman problem in which a set of clients must be visited by a collection of capacitated tours. Each tour can visit at most Q clients and must start and end at a specified depot. We present the first approximation scheme for Capacitated Vehicle Routing for non-Euclidean metrics. Specifically we give a quasi-polynomial-time approximation scheme for Capacitated Vehicle Routing with fixed capacities on planar graphs. We also show how this result can be extended to bounded-genus graphs and polylogarithmic capacities, as well as to variations of the problem that include multiple depots and charging penalties for unvisited clients. 1998 ACM Subject Classification G.2.2 Graph Algorithms

[1]  David Eppstein,et al.  Dynamic generators of topologically embedded graphs , 2002, SODA '03.

[2]  David Eisenstat,et al.  Approximating k-center in planar graphs , 2014, SODA.

[3]  Mikhail Yu. Khachay,et al.  PTAS for the Euclidean Capacitated Vehicle Routing Problem in R^d , 2016, DOOR.

[4]  Philip N. Klein,et al.  A polynomial-time approximation scheme for weighted planar graph TSP , 1998, SODA '98.

[5]  Andrzej Lingas,et al.  PTAS for k-tour cover problem on the plane for moderately large values of k , 2009, ISAAC.

[6]  Philip N. Klein,et al.  Approximating connectivity domination in weighted bounded-genus graphs , 2016, STOC.

[7]  Tetsuo Asano,et al.  A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree , 1999, ISAAC.

[8]  Mikhail Yu. Khachay,et al.  Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem , 2015, COCOA.

[9]  Mikkel Thorup,et al.  Compact oracles for reachability and approximate distances in planar digraphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[10]  Tetsuo Asano,et al.  Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k , 1997, STOC '97.

[11]  Alexander H. G. Rinnooy Kan,et al.  Bounds and Heuristics for Capacitated Routing Problems , 1985, Math. Oper. Res..

[12]  Naoki Katoh,et al.  A Capacitated Vehicle Routing Problem on a Tree , 1998, ISAAC.

[13]  Bruce L. Golden,et al.  Capacitated arc routing problems , 1981, Networks.

[14]  Paolo Toth,et al.  The Family of Vehicle Routing Problems , 2014, Vehicle Routing.

[15]  Claire Mathieu,et al.  A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing , 2008, Algorithmica.

[16]  Christos H. Papadimitriou,et al.  An approximation scheme for planar graph TSP , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.