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 obtained

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

Solutions obtained
InstanceSizevrplazy
eil7 7 137* 137*
eil13 13 336* 336*
eil22 22 427* 427*
eil23 23 583* 583*
eil30 30 521* 521*
eil31 31 550* 550*
eil33 33 1077* 1077*
att48 48 - 13139*
eil51 51 - 569*
eilA76 76 - -
eilB76 76 - -
eilC76 76 - -
eilD76 76 - -
eilA101 101 - -
eilB101 101 - -
gil262 262 - -