Search - Optimization by Simulated Annealing

Search - Optimization by Simulated Annealing - List

[Algorithm] matlab模拟退火 DL : 0: 模拟退火算法是为了避免求解最优化出现局部极值的问题而提出的算法，保证最终的结果是全局最优的，该matlab源程序能在matlab环境中实现-simulated annealing method is the best solution in order to avoid a partial optimization of extreme concern raised by the algorithm to ensure that the final result is that the global optimum, the source Matlab can achieve Matlab environment
Date : 2026-01-21 Size : 5kb User : yj
[Algorithm] monituihuo DL : 0: 模拟退火fortran程序,可以根据优化函数设置参数-C Simulated annealing is a global optimization method that distinguishes C between different local optima. Starting from an initial point, the C algorithm takes a step and the function is evaluated. When minimizing a C function, any downhill step is accepted and the process repeats from this C new point. An uphill step may be accepted. Thus, it can escape from local C optima. This uphill decision is made by the Metropolis criteria. As the C optimization process proceeds, the length of the steps decline and the C algorithm closes in on the global optimum. Since the algorithm makes very C few assumptions regarding the function to be optimized, it is quite C robust with respect to non-quadratic surfaces. The degree of robustness C can be adjusted by the user. In fact, simulated annealing can be used as C a local optimizer for difficult functions.
Date : 2026-01-21 Size : 12kb User : meibujun
[Algorithm] erweichazhi DL : 0: 改进二维插值算法，应用并实现，希望对大家有所帮助。-simulated annealing method is the best solution in order to avoid a partial optimization of extreme concern raised by the algorithm to ensure that the final result is that the global optimum, the source Matlab can achieve Matlab environment
Date : 2026-01-21 Size : 1kb User : ginger
[Algorithm] SA DL : 0: 模拟退火算法的MATLAB实现，通过赋予搜索过程一种时变且最终趋于零的概率突跳性，从而可有效避免陷入局部极小并最终趋于全局最优的串行结构的优化算法。-MATLAB implementation of simulated annealing algorithm, a search process by giving time-varying and ultimately tends to zero the probability of jumps, which can effectively avoid local minima and ultimately global optimization algorithm has been optimized serial structure.
Date : 2026-01-21 Size : 1kb User : 李天
[Algorithm] 模拟退火算法及其在求解TSP中的应用 DL : 0: 模拟退火算法(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.)
Date : 2026-01-21 Size : 149kb User : 绝情逆空