文档介绍：摘要
生活中存在许多需要使用优化的情况,,它一直以来都是一个优化领域的热点,,它拥有相较于早期其他优化算法更便于计算,使用灵活适用于并行运算的优点,,在1953年被Metropofis提出这种先进的思想,而后被Kirkpatrick等人于1983年引入到优化组合领域中,,它可用于的领域包括着工程科学在内的多种领域中.(删掉,摘要里不需要写这些)
模拟退火算法虽然在各个领域中有着十分的成就,,,本文中对其举出例子来演示其在优化问题中的表现.
在组合优化领域中NP(NP-Hard)问题一直都是一个麻烦的问题,尤其其中著名的旅行商问题有着简单、,就是在几个点中找出最为短的路径;.
关键词:模拟退火算法;组合优化问题;TSP问题
Abstract
Many require the use of optimization condition exists in life, and in order to resolve this situation occurs many optimization algorithm. Simulation is bination of several optimization algorithm of simulated annealing algorithm, it is always a hot one optimization field, received the majority of researchers. As a leader bination optimization algorithm, it pared to other early optimization algorithm more easy to calculate, the use of flexible advantages of puting, solve the infeasible factor part of traditional algorithm cannot avoid large-scale problems. Simulated annealing algorithm derived from the simulated annealing process, in 1953 Metropofis proposed the advanced ideas, and then by Kirkpatrick et al in 1983 into the optimization in the field, then the simulated annealing algorithm is one of many in the optimization algorithm. Of course, this algorithm is not only superior to simple optimization problems in various fields, which can be used in fields including engineering science in. Simulated annealing algorithm is very ess in every field, but it is in binatorial optimization and occupies a very important position. This paper will make a brief for the simulated annealing algorithm to make the background, principle and content of the simulated annealing algorithm. In order to more clearly understand the performance of simulated annealing, to