| Kieli | Käännökset |
|---|---|
| ranska | recuit simulé |
| tšekki | simulované žíhání |
| Monikko | simulated annealings |
A probabilistic technique for approximating the global optimum of a given function, analogous to the metalworking process of annealing.
Simulated annealing can be used to solve combinatorial problems. Here it is applied to the travelling salesman problem to minimize the length of a route that connects all 125 points.
A probabilistic technique for approximating the global optimum of a given function, analogous to the metalworking process of annealing.
Travelling salesman problem in 3D for 120 points solved with simulated annealing.
A probabilistic technique for approximating the global optimum of a given function, analogous to the metalworking process of annealing.
Simulated annealing searching for a maximum. The objective here is to get to the highest point. In this example, it is not enough to use a simple hill climb algorithm, as there are many local maxima. By cooling the temperature slowly the global maximum is found.