A method for maximizing a function that permits an algorithm to choose apparently suboptimal routes, but with decreasing probability as the number of iterations increases (see iterative algorithm). The initially fluid choice of values becomes increasingly set as the algorithm progresses. The object is to reduce the chance of ending at a local maximum.