Speedy simulated annealing
Boris S. Kiselyov, Nickolay Y. Kulakov, Andrei L. Mikaelian · 1992
The essence of the simulated annealing method is illustrated by an example of a problem of optimal work distribution (assignment problem). The proposed method considerably reduces the time of solving problems of combinatorial optimization. The application of this algorithm is especially important in cases where the time of calculating fluctuations exceeds the time needed to perform rearrangements. The algorithm is recommended for application in optical implementations of learning machines.>