Traveling Salesman Problem (TSP) has been an interesting problem for a l me in classical optimization techniques which are based on linear and nonlin ogramming. TSP can be described as follows: Given a numberof cities to v d their distances from all other cities know, an optimal travel route has to und so that each city is visited one and only once with the least possible dista aveled. This is a simple problem with handful of cities but becomes complica the number increases.

SA_TSP\data_file.m
......\distance.m
......\loadatt48.m
......\loadbays29.m
......\loadeil101.m
......\loadeil535.m
......\loadgr96.m
......\loadpcb442.m
......\loadpr76.m
......\loadst70.m
......\plotcities.m
......\simulatedannealing.m
......\Simulated_Annealing_Support_Document.pdf
......\stsp.fig
......\stsp.m
......\stsp_v61.fig
......\stsp_v61.m
......\stsp_v61_export.m
......\swapcities.m
SA_TSP

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．