TSP Solution
TSP Solution
1 2 3 4 5
From 1 10000 13 22 16 6
2 13 10000 29 20 8
3 22 29 10000 11 30
4 16 20 11 10000 20
5 6 8 30 20 10000
Variables
Xij 1 2 3 4 5
1 0 1 0 0 0
2 0 0 0 0 1
3 0 0 0 1 0
4 0 0 1 0 0
5 1 0 0 0 0
Total cost 49
Constraint
From Total
1 1 1 1 1 1 1 equal to
2 1 1 1 1 1 1 equal to
3 1 1 1 1 1 1 equal to
4 1 1 1 1 1 1 equal to
5 1 1 1 1 1 1 equal to
To 1 equal to
1 equal to
1 equal to
1 equal to
1 equal to
Requirement
1
1
1
1
1
1
1
1
1
1
Distance matrix To
1 2 3 4 5
From 1 10000 13 22 16 6
2 13 10000 29 20 8
3 22 29 10000 11 30
4 16 20 11 10000 20
5 6 8 30 20 10000
Variables
Xij 1 2 3 4 5
1 0 0 1 0 0
2 0 0 0 0 1
3 0 0 0 1 0
4 0 1 0 0 0
5 1 0 0 0 0
Total cost 67
Constraint
From Total Requirement
1 1 1 1 1 1 1 equal to 1
2 1 1 1 1 1 1 equal to 1
3 1 1 1 1 1 1 equal to 1
4 1 1 1 1 1 1 equal to 1
5 1 1 1 1 1 1 equal to 1
To 1 equal to 1
1 equal to 1
1 equal to 1
1 equal to 1
1 equal to 1
2,3 3 0 0
2,4 3 2 0
2,5 3 4 5
3,2 0 3 0
3,4 0 2 5
3,5 0 4 0
4,2 2 3 5
4,3 2 0 0
4,5 2 4 0
5,2 4 3 0
5,3 4 0 0
5,4 4 2 0
2 3 4 5
3 0 2 4
LHS RHS
<= 4
3 <= 4
1 <= 4
4 <= 4
-3 <= 4
3 <= 4
-4 <= 4
4 <= 4
2 <= 4
-2 <= 4
1 <= 4
4 <= 4
2 <= 4