mggdb_0.35
Here you find instance definitions and the best known upper and lower bounds (to our knowledge) for the 23 instances of the mggdb (ß=0.35) 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.35 instance definitions can be found, as a zip-file here.

 

Best known results for the mggdb_0.35 benchmark

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

InstanceUpper Bound ReferenceLower BoundReferenceGAP(%)
mggdb_0.35_1* 252 BLMV 252 BLMV 0
mggdb_0.35_2* 284 BLMV 284 BLMV 0
mggdb_0.35_3* 243 BLMV 243 BLMV 0
mggdb_0.35_4* 242 BLMV 242 BLMV 0
mggdb_0.35_5* 309 BLMV 309 BLW 0
mggdb_0.35_6* 262 BLMV 262 BLMV 0
mggdb_0.35_7* 272 BLMV 272 BLMV 0
 mggdb_0.35_8 316 DDHI  315  BLW 0.32
 mggdb_0.35_9 266 DDHI  265  BLW 0.38
mggdb_0.35_10* 268 BLMV 268 BLMV 0
mggdb_0.35_11* 303 BLMV 303 BLMV 0
mggdb_0.35_12* 461 BLMV 461 BLMV 0
mggdb_0.35_13* 417 BLMV 417 G 0
mggdb_0.35_14* 84 BLMV 84 BLMV 0
mggdb_0.35_15* 44 BLMV 44 BLMV 0
mggdb_0.35_16* 75 BLMV 75 BLMV 0
mggdb_0.35_17* 62 BLMV 62 BLMV 0
mggdb_0.35_18* 135 BLMV 135 BLMV 0
mggdb_0.35_19* 51 BLMV 51 BLMV 0
mggdb_0.35_20* 96 BLMV 96 BLMV 0
mggdb_0.35_21* 120 BLMV 120 BLW 0
mggdb_0.35_22* 139 DDHI 139 BLW 0
mggdb_0.35_23* 179 DDHI 179 BLW  0
 

References

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