Simulated annealing (SA) is a probabilistic technique for approximating the global optimum of a given function. Specifically, it is a metaheuristic to approximate global optimization in a large search space. It is often used when the search space is

Simulated annealing (SA) is a probabilistic technique for approximating the global optimum of a given function. Specifically, it is a metaheuristic to approximate global optimization in a large search space. It is often used when the search space is

用模拟退火程序在三维空间内跳跃寻找最值，适用于二次函数，全局最优(The simulated annealing program is used to jump in the three-dimensional space to find the maximum value, which is suitable for the two function, the global optimum.)