Department of Economics and Business Economics

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

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

DOI

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.
Original languageEnglish
JournalNetworks
Volume68
Issue3
Pages (from-to)161-184
Number of pages24
ISSN0028-3045
DOIs
Publication statusPublished - 2016

See relations at Aarhus University Citationformats

ID: 102385154