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

 

Best known results for the mgval_0.35 benchmark

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

InstanceUpper Bound ReferenceLower BoundReferenceGAP(%)
mgval_0.35_1A* 158 BLMV 158 BLMV 0
mgval_0.35_2A* 286 BLMV 286 BLMV 0
mgval_0.35_3A* 84 BLMV 84 BLMV 0
mgval_0.35_4A* 430 BLMV 430 BILV 0
mgval_0.35_5A* 454 BLMV 454 BILV 0
mgval_0.35_6A* 248 BLMV 248 BLMV 0
mgval_0.35_7A* 264 BLMV 264 BLMV 0
mgval_0.35_8A* 415 BLMV 415 BILV 0
mgval_0.35_9A* 324 BLMV 324 BLMV 0
mgval_0.35_10A* 475 BLMV 475 BLMV 0
mgval_0.35_1B* 192 BLMV 192 BLMV 0
mgval_0.35_2B* 326 BLMV 326 BLMV 0
mgval_0.35_3B* 113 BLMV 113 BLMV 0
mgval_0.35_4B 531 BLMV 529 BILV 0.38
mgval_0.35_5B 467 BLMV 466 BILV 0.21
mgval_0.35_6B* 250 BLMV 250 BLMV 0
mgval_0.35_7B* 325 BLMV 325 BLMV 0
mgval_0.35_8B* 385 BLMV 385 BILV 0
mgval_0.35_9B* 331 DDHI 331 BILV 0
mgval_0.35_10B*  461 BLMV 461 BILV 0
mgval_0.35_1C 284 BLMV2 272 BILV 4.41
mgval_0.35_2C 485 DDHI 482 BILV 0.62
mgval_0.35_3C* 149 G 149 BILV 0
mgval_0.35_4C*  516 BLMV 516 BILV 0
mgval_0.35_5C  586 BLMV 579 BILV 1.21
mgval_0.35_6C  312 DDHI 303 BILV 2.97
mgval_0.35_7C* 336 DDHI 336 BILV 0
mgval_0.35_8C 494 DDHI 487 BILV 1.44
mgval_0.35_9C* 328 DDHI 328 BILV 0
mgval_0.35_10C 430 DDHI 428 BILV 4.37
mgval_0.35_4D 643 DDHI 640.5 BILV 0.47
mgval_0.35_5D  578 DDHI 568 BILV 1.76
mgval_0.35_9D 430 DDHI 422 BILV 1.90
mgval_0.35_10D 523 DDHI 519 BILV 0.77
 

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.

BLMV2 - A. Bosco, D. Lagana, R. Musmanno, and F. Vocaturo. A matheuristic algorithm for the mixed capacitated general routing problem. Networks, in press.

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