A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments

Abstract

We prove that any polynomial-time $\alpha (n)$-approximation algorithm for the $n$-vertex metric asymmetric Traveling Salesperson Problem yields a polynomial-time $O(\alpha (C))$-approximation algorithm for the mixed and windy Capacitated Arc Routing Problem, where $C$ is the number of weakly connected components in the subgraph induced by the positive-demand arcs---a small number in many applications. In conjunction with known results, we obtain constant-factor approximations for $C\in O(\log n)$ and $O(\log C/\log \log C)$-approximations in general. Experiments show that our algorithm, together with several heuristic enhancements, outperforms many previous polynomial-time heuristics. Finally, since the solution quality achievable in polynomial time appears to mainly depend on $C$ and since $C=1$ in almost all benchmark instances, we propose the Ob benchmark set, simulating cities that are divided into several components by a river.

A preliminary version of this article appeared in the Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'15). This version describes several algorithmic enhancements, contains an experimental evaluation of our algorithm, and provides a new benchmark data set

References in corpus (1)

• Constant-factor approximations for Capacitated Arc Routing without triangle inequality

Cited by in corpus (6)

• Parameterized complexity of machine scheduling: 15 open problems
• Inductive $k$-independent graphs and $c$-colorable subgraphs in scheduling: A review
• On approximate data reduction for the Rural Postman Problem: Theory and experiments
• Parameterized algorithms and data reduction for the short secluded $s$-$t$-path problem
• Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
• Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions