A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments1. Issue 3 (8th April 2017)

• Record Type: Journal Article
• Authors: van Bevern, René; Komusiewicz, Christian; Sorge, Manuel
• Is Part Of: Networks. Volume 70:Issue 3(2017)
• Page Start: 262
• Page End: 278
• Publication Date: 2017-04-08
• Subjects: vehicle routing -- transportation -- Rural Postman -- Chinese Postman -- NP‐hard problem -- fixed‐parameter algorithm -- combinatorial optimization; Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21742
• Languages: English
• ISSNs: 0028-3045

Abstract

Abstract : We prove that any polynomial‐time α ( n ) ‐approximation algorithm for the n ‐vertex metric asymmetric Traveling Salesperson Problem yields a polynomial‐time O ( α ( 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 ∈ 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. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 70(3), 262–278 2017