TC6544

Assignment 6

The traveling salesman problem (TSP) can be represented as a fully connected graph
in Figure 1, with six nodes as cities. The edge between nodes represents the distance
between cities.

Figure 1

Apply a Simulated Annealing and a Great Deluge algorithm to minimize the distance
traveled. Note that students are required to plot accepted solutions and the best solution
at each iteration. The submission includes commented source code and graphs.

Salwani Abdullah/TC6544/Dec2022