Work

A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments

Year: 2017

Type: article

Abstract: We prove that any polynomial‐time ‐approximation algorithm for then‐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 onCand sinceC = 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

Source: Networks

DOI: 10.1002/net.21742

Authors: René van Bevern, Christian Komusiewicz, Manuel Sorge

Institutions: Novosibirsk State University, Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Friedrich Schiller University Jena, Technische Universität Berlin

Language: English

Topic: Vehicle Routing Optimization Methods

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: green

Funders: Deutsche Forschungsgemeinschaft, Russian Foundation for Basic Research

Awards: G6528744843, G659201379, G903791681