1 research outputs found
A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments
We prove that any polynomial-time -approximation algorithm for the
-vertex metric asymmetric Traveling Salesperson Problem yields a
polynomial-time -approximation algorithm for the mixed and windy
Capacitated Arc Routing Problem, where 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 and -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 and since in almost all benchmark
instances, we propose the Ob benchmark set, simulating cities that are divided
into several components by a river.Comment: 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 se