CBMix benchmark
Here you find instance definitions and the best known upper and lower bounds (to our knowledge) for the 23 instances of the CBMix benchmark created by Prins and Bouchenoua in 2004 [PB]. 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 CBMix instance definitions can be found, as a zip-file, here.
Best known results for the CBMix benchmarkFor the Upper Bound values in blue, you get the detailed solution by clicking on the value.
* Optimal value, instance has been closed.
References 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. BLMV - A. Bosco, D. Lagana, R. Musmanno, and F. Vocaturo. Modeling and solving the mixed capacitated general routing problem. Optimization Letters (2012), pp 1-19, doi 10.1007/s11590-012-0552-y. 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. 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. KMK - H. Kokubugata, A. Moriyama and H. Kawashima, "A Practical Solution Using Simulated Annealing for General Routing Problems with Nodes, Edges, and Arcs", Japan, 2007 PB - C. Prins and S. Bouchenoua, "A Memetic Algorithm Solving VRP, the CARP and General Routing Problems with Nodes, Edges and Arcs", Recent advances in memetic algorithms, France, 2004 |
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||