| Article ID: | iaor20163224 |
| Volume: | 68 |
| Issue: | 3 |
| Start Page Number: | 161 |
| End Page Number: | 184 |
| Publication Date: | Oct 2016 |
| Journal: | Networks |
| Authors: | Lysgaard Jens, Whlk Sanne, Bach Lukas |
| Keywords: | vehicle routing & scheduling, combinatorial optimization, heuristics |
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.