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

 

Best known results for the mgval_0.25 benchmark

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

InstanceUpper Bound ReferenceLower BoundReferenceGAP(%)
mgval_0.25_1A* 177 BLMV 177 BLMV 0
mgval_0.25_2A* 259 BLMV 259 BLMV 0
mgval_0.25_3A* 89 BLMV 89 BLMV 0
mgval_0.25_4A* 514 BLMV 514 BILV 0
mgval_0.25_5A* 485 BLMV 485 BLMV 0
mgval_0.25_6A* 274 BLMV 274 BLMV 0
mgval_0.25_7A* 297 BLMV 297 BLMV 0
mgval_0.25_8A* 510 BLMV 510 BILV 0
mgval_0.25_9A* 371 BLMV 371 BILV 0
mgval_0.25_10A* 492 BLMV 492 BLMV 0
mgval_0.25_1B* 217 BLMV 217 BLMV 0
mgval_0.25_2B* 336 BLMV 336 BLMV 0
mgval_0.25_3B* 125 BLMV 125 BLMV 0
mgval_0.25_4B* 537 BLMV 537 BILV 0
mgval_0.25_5B* 493 BLMV 493 BILV 0
mgval_0.25_6B* 263 BLMV 263 BILV 0
mgval_0.25_7B* 355 BLMV 355 BLMV 0
mgval_0.25_8B* 423 BLMV 423 BILV 0
mgval_0.25_9B* 358 BLMV  358 BILV 0
mgval_0.25_10B* 528 BLMV 528 BLMV  0 
mgval_0.25_1C 279 DDHI 278 BILV 0.36 
mgval_0.25_2C 480 DDHI 479 BILV 0.21 
mgval_0.25_3C* 153 BLMV 153 BILV 0
mgval_0.25_4C* 525 BLMV 525 BILV 0
mgval_0.25_5C* 584 BLMV 584 BILV 0
mgval_0.25_6C 324 DDHI 316 BILV 2.53
mgval_0.25_7C 378 DDHI 374 BILV 1.07
mgval_0.25_8C  545 DDHI 538 BILV 1.30
mgval_0.25_9C 365 BLMV 348 BLMV 4.93
mgval_0.25_10C 483 BLMV 480 BLMV 0.62
mgval_0.25_4D 683 DDHI 675 BILV 1.19
mgval_0.25_5D 644 DDHI 635 BILV 1.42
mgval_0.25_9D 429 DDHI 418 BILV 2.63
mgval_0.25_10D 567 DDHI 565.5 BILV 0.27
 

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. Laganà, 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.

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