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

Solutions failed

Legend for columns in the next tables
LabelDescription
inst Instance name
vrp Solutions failed using cutting planes (limiting number of arcs in connected components)
lazy Solutions failed using cutting planes and lazy constraints (callback on MIPSOL)

chart
Number of failed solution attempts
InstanceSizevrplazy
eil7 7 0 0
eil13 13 0 0
eil22 22 0 0
eil23 23 0 0
eil30 30 0 0
eil31 31 0 0
eil33 33 0 0
att48 48 1 0
eil51 51 2 0
eilA76,eilB76,eilC76,eilD76 76 6 4
eilA101,eilB101 101 8 6
gil262 262 9 7