Here you find instance definitions and the best known upper and lower bounds (to our knowledge) for the 20 instances of the BHW benchmark generated from popular benchmark instances for the CARP [BHW]. The values for the upper and lower bounds reported in the table only include traversal costs, i.e. service costs are omitted.
Instance definitions (text)
The BHW instance definitions can be found, as a zip-file here.
Best known results for the BHW benchmark
For the Upper Bound values in blue, you get the detailed solution by clicking on the value.
* Optimal value, instance has been closed.
BHW - Lukas Bach, Geir Hasle, Sanne Wøhlk: A Lower Bound for the Node, Edge, and Arc Routing Problem. Computers & Operations Research 40 (2013) 943–952.
BLW - L. Bach, J. Lysgaard, S. Wøhlk. A Branch-and-Cut-and-Price Algorithm for the Mixed Capacitated General Routing Problem. In L. Bach: Routing and Scheduling Problems – Optimization using Exact and Heuristic Methods. Ph.D. dissertation, School of Business and Social Sciences, Aarhus University, Denmark, 2014.
DDHI - M. Dell'Amico, J. C. Díaz Díaz, G. Hasle, M. Iori. An Adaptive Iterated Local Search for the Mixed Capacitated General Routing Problem. SINTEF Report A26278. 2014-05-16. ISBN 978-82-14-05361-6.
G - K. A. Gaze, G. Hasle, C. Mannino. Column Generation for the Mixed Capacitated General Routing Problem. Talk at WARP 1 - First Workshop on Arc Routing Problems, Copenhagen May 22-24 2013.