Traveling-Salesman Problem
1
2
4
3
Distance matrix
Analysis:
1
2
3
4
Our solution happens to be the
1
\
40
55
28
optimal solution in this problem, but it
is not always true -_-
2
40
\
16
7
We can see that heuristic algorithm
can find a good (sometimes optimal) in
3
55
16
\
66
a reasonable time ^_^
4
28
7
66
\
Finally, review what happens...