Title:
MATLAB-Code-for-Simulated-Annealing Download
- Category:
- matlab
- Tags:
-
- File Size:
- 13kb
- Update:
- 2012-11-26
- Downloads:
- 0 Times
- Uploaded by:
- german_ini
Description: TSP can be defined as a problem where starting from a node it is required to visit every other node only once in a way that the total distance covered is minimized. After an initial solution a neighborhood solution is selected by an exchange of a randomly selected pair of nodes. The randomly generated neighbor solution is selected if it improves the solution else it is selected with a probability that depends on the extent to which it deteriorates from the current solution.
File list (Check if you may need any files):
MATLAB-Code-for-Simulated-Annealing.docx