simulated annealing
A computing optimization algorithm inspired by the annealing process in metallurgy, used to find an approximate global optimum.
Simulated annealing is often used for combinatorial optimization problems like the traveling salesman problem.
Standard kanji spelling using 焼きなまし (annealing) and 法 (method).
Alternate kanji spelling using 鈍し (blunting/dulling) for the annealing process; less common but attested.
From 焼きなまし (annealing) + 法 (method). The computing term is a direct translation of the English 'simulated annealing'.