The earliest idea of Simulated Annealing (SA) was put forward by N. Metropolis [1] and others in 1953. In 1983, S. Kirkpatrick successfully introduced the idea of annealing to the field of combinatorial optimization. It is a stochastic optimization algorithm based on the Monte-Carlo iterative solution strategy. The starting point is based on the similarity between the annealing process of solid matter in physics and the general combinatorial optimization problem.

Filename	Size	Update
模拟退火算法及其在求解TSP中的应用.pdf	178921	2017-11-29

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