mggdb_0.30
Here you find instance definitions and the best known upper and lower bounds (to our knowledge) for the 23 instances of the mggdb (ß=0.30) benchmark derived from the CARP by Bosco et al. [BLMV]. 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 mggdb_0.30 instance definitions can be found, as a zip-file here.

 

Best known results for the mggdb_0.30 benchmark

For the Upper Bound values in blue, you get the detailed solution by clicking on the value.

InstanceUpper Bound ReferenceLower BoundReferenceGAP(%)
mggdb_0.30_1* 273 BLMV 273 BLMV 0
mggdb_0.30_2* 301 BLMV 301 BLW 0
mggdb_0.30_3* 270 BLMV 270 BLMV 0
mggdb_0.30_4* 260 BLMV 260 BLMV 0
mggdb_0.30_5* 388 BLMV 388 BLW 0
mggdb_0.30_6* 276 BLMV 276 BLMV 0
mggdb_0.30_7* 273 BLMV 273 BLMV 0
mggdb_0.30_8 331  DDHI 329  G  0.61
mggdb_0.30_9* 281  DDHI 281  BLW 0
mggdb_0.30_10* 242 BLMV 242 BLMV 0
mggdb_0.30_11* 387 BLMV 387 BILV 0
mggdb_0.30_12* 467 BLMV 467 BLW 0
mggdb_0.30_13* 483 DDIH 483 BLW 0
mggdb_0.30_14* 101 BLMV 101 BLMV 0
mggdb_0.30_15* 44 BLMV 44 BLMV 0
mggdb_0.30_16* 105 BLMV 105 BLMV 0
mggdb_0.30_17* 65 BLMV 65 BLMV 0
mggdb_0.30_18* 144 BLMV 144 BLMV 0
mggdb_0.30_19* 51 BLMV 51 BLMV 0
mggdb_0.30_20* 94 BLMV 94 BLMV 0
mggdb_0.30_21* 121 BLMV  121 G 0
mggdb_0.30_22* 153 DDHI 153 BLW 0
mggdb_0.30_23*  167 DDHI 167 G 0 
 

References

BILV - C. Bode, S. Irnich, D. Laganà, F. Vocaturo. Two-Phase Branch-and-Cut for the Mixed Capacitated General Routing Problem. Technical Report LM-2014-02, University of Mainz.

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.

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.

Published June 22, 2012