A Branch-and-Cut-and-Price Algorithm for the Mixed Capacitated General Routing Problem

作者：Bach Lukas; Lysgaard Jens; Wohlk Sanne^*

来源：Networks, 2016, 68(3): 161-184.

DOI：10.1002/net.21690

• Mixed Capacitated General Routing Problem
• Branch-And-Cut-And-Price
• The Node
• Edge
• And Arc Routing Problem
• 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.

• 出版日期2016-10