Traveling Salesman Problem with Time Windows

Results obtained using Gurobi for solving the Traveling Salesman Problem with Time Windows, using the models described in Mathematical Optimization: Solving Problems using Python and Gurobi. Benchmark instances are available in this site. CPU time limited to 3600 seconds. (Click on values for selecting instance type and time window factor.)

 Performance data Dumas Dumas Dumas Dumas Gendreau Gendreau Gendreau Gendreau Gendreau Gendreau Gendreau CPU time required [20] [40] [60] [80] [80] [100] [120] [140] [160] [180] [200] Number of solution failures [20] [40] [60] [80] [80] [100] [120] [140] [160] [180] [200] Solutions [20] [40] [60] [80] [80] [100] [120] [140] [160] [180] [200]

Solutions obtained

Instance type: Gendreau, time window factor: 100

Results obtained using Gurobi for solving the Traveling Salesman Problem with Time Windows, using the models described in Mathematical Optimization: Solving Problems using Python and Gurobi. Benchmark instances are available in this site. CPU time limited to 3600 seconds. (Click on values for selecting instance type and time window factor.)

Benchmark instances used are described in "Gendreau et al. 1998. A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows. Operations Research, 43, 330 - 335."

 Label Description mtz-tw model based on Miller-Tucker-Zemlin's one-index potential formulation mtz-strong based on Miller-Tucker-Zemlin's one-index potential formulation, with stronger constraints mtz-2idx based on Miller-Tucker-Zemlin's formulation, two-index potential formulation

 Instance Size mtz-tw mtz-strong mtz-2idx n100w100.001 100 no sol, 595 705, 598 no sol, 541 n100w100.002 100 no sol, 560 no sol, 562 no sol, 508 n100w100.003 100 694, 650 697, 654 no sol, 599 n100w100.004 100 no sol, 628 no sol, 637 no sol, 573 n100w100.005 100 590, 533 583, 541 no sol, 437