Simulated Annealing Method for the Traveling Salesman Model Documents
This material has 2 associated documents. Select a document title to view a document's information.
The Simulated Annealing Method for the Traveling Salesman Model demonstrates the use of the "simulated annealing algorithm" to attempt to solve the "travelling salesman" problem. A text file containing longitude and latitude data for 120 cities in the US and southern Canada is loaded when this program begins. Other data can be loaded instead, but the data file should have the same format as this text file (available under "source"). A "temperature" controls how much the results (in this case, the total distance traveled) are allowed to fluctuate. In the process of annealing, the temperature is slowly lowered in an attempt to minimize the total distance traveled, and it can also be manually adjusted with a slider.
Last Modified June 12, 2014
This file has previous versions.
Source Code Documents
The source code zip archive contains an EJS-XML representation of the Simulated Annealing Method for the Traveling Salesman Model. Unzip this archive in your EJS workspace to compile and run this model using EJS.
Last Modified November 12, 2011