模拟退火算法(Simulated Annealing，SA)最早的思想是由N. Metropolis [1]　等人于1953年提出。1983 年,S. Kirkpatrick 等成功地将退火思想引入到组合优化领域。它是基于Monte-Carlo迭代求解策略的一种随机寻优算法，其出发点是基于物理中固体物质的退火过程与一般组合优化问题之间的相似性。(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.)