Speedy simulated annealing

摘要

The essence of the simulated annealing method is illustrated by anexample of a problem of optimal work distribution (assignment problem).The proposed method considerably reduces the time of solving problems ofcombinatorial optimization. The application of this algorithm isespecially important in cases where the time of calculating fluctuationsexceeds the time needed to perform rearrangements. The algorithm isrecommended for application in optical implementations of learningmachines