Vehicle Routing Problem: Results obtained for TSPLIB instances


Results obtained using Gurobi for solving the vehicle routing problem, using several cutting plane strategies described in Mathematical Optimization: Solving Problems using Python and Gurobi. CPU time limited to 3600 seconds. (Click on values for selecting data to display.)

Performance data
CPU time required
Number of solution failures
Solutions

CPU used

(click on values for detailed output)
Legend for columns in the next tables
LabelDescription
inst Instance name
vrp Time used using cutting planes (limiting number of arcs in connected components)
lazy Time used using cutting planes and lazy constraints (callback on MIPSOL)

chart
CPU used as a function of instance size
InstanceSizevrplazy
eil7 7 0.00 0.00
eil13 13 0.56 0.04
eil22 22 0.12 0.04
eil23 23 0.07 0.04
eil30 30 0.11 0.04
eil31 31 687.48 4.01
eil33 33 1312.14 5.32
att48 48 >3600 279.65
eil51 51 >3600 193.46
eilA76 76 >3600 >3600
eilB76 76 >3600 >3600
eilC76 76 >3600 >3600
eilD76 76 >3600 >3600
eilA101 101 >3600 >3600
eilB101 101 >3600 >3600
gil262 262 - -