A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem.

In this paper, we consider the Mixed Capacitated General Routing Problem which is a combination of the Capacitated Vehicle Routing Problem and the Capacitated Arc Routing Problem. The problem is also known as the Node, Edge, and Arc Routing Problem. We propose a Branch-and-Cut-and-Price algorithm for obtaining optimal solutions to the problem and present computational results based on a set of standard benchmark instances. (C) 2016 Wiley Periodicals, Inc.