Solving the model

Prerequisites

Get the solution

The resulting output

For better understanding we visualized the output below. The optimal tour has a length of 38700 and follows the purple arrows.
The tour is Paderborn -> Beijing -> San Francisco -> New York -> São Paulo -> Paderborn.

By solving the model we generate the following output:

Optimizing the Model...
Optimize a model with 23 rows, 10 columns and 52 nonzeros
Coefficient statistics:
  Matrix range    [1e+00, 1e+00]
  Objective range [4e+03, 1e+04]
  Bounds range    [1e+00, 1e+00]
  RHS range       [1e+00, 4e+00]
Found heuristic solution: objective 44400
Presolve removed 23 rows and 10 columns
Presolve time: 0.00s
Presolve: All rows and columns removed

Explored 0 nodes (0 simplex iterations) in 0.20 seconds
Thread count was 1 (of 4 available processors)

Optimal solution found (tolerance 0.00e+00)
Best objective 3.870000000000e+04, best bound 3.870000000000e+04, gap 0.0%
[sum of all distances, 38700]
Paderborn to node New York with distance 6100_B: 0
Paderborn to node Beijing with distance 7600_C: 1
Paderborn to node São Paulo with distance 9900_D: 0
São Paulo to node Paderborn with distance 9900_E: 1
Beijing to node New York with distance 11000_F: 0
San Francisco to node New York with distance 4100_G: 1
New York to node Beijing with distance 11000_H: 0
New York to node São Paulo with distance 7600_I: 1
San Francisco to node São Paulo with distance 10500_J: 0
Beijing to node San Francisco with distance 9500_K: 1

Next Step

  • Here you can find even more Models