Scribd
Upload
53 views1 page

TC6544-Assignment-6 by SBA

The document discusses applying simulated annealing and great deluge algorithms to solve the traveling salesman problem represented as a fully connected graph with six cities. Students must implement the algorithms to minimize the total distance traveled, and include source code and graphs plotting the accepted solutions and best solution at each iteration in their submission.

Uploaded by

Akram Ta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
53 views1 page

TC6544-Assignment-6 by SBA

The document discusses applying simulated annealing and great deluge algorithms to solve the traveling salesman problem represented as a fully connected graph with six cities. Students must implement the algorithms to minimize the total distance traveled, and include source code and graphs plotting the accepted solutions and best solution at each iteration in their submission.

Uploaded by

Akram Ta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

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

You might also like