In fact, simulated annealing is also a kind of greedy algorithm, but its search process introduces random factors. The simulated annealing algorithm accepts a worse solution than the current solution with a certain probability, so it may jump out of the local optimal solution and reach the global optimal solution.
Advantages of SA:
- The calculation process is simple
- It can be widely used
- Strong robustness
- It is suitable for parallel processing
- It can be used to solve complex nonlinear optimization problems
Disadvantages of SA:
- The convergence speed is slow
- Long execution time
- The performance of the algorithm is related to the initial value and parameter sensitivity
The pseudocode was written in SA.txt
https://blog.csdn.net/weixin_40562999/article/details/80853354
https://www.cnblogs.com/heaad/archive/2010/12/20/1911614.html