Using simulated annealing to solve the traveling salesman problem, because the problem itself is a NP hard problem, so it can not find the optimal solution, but it should be able to obtain a better solution, and then manually optimized.

SA\computer_tour.m
SA\main.m
SA\netplot.m
SA\perturb_tour.m
SA

• 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．