DocumentCode
1579394
Title
Speedy simulated annealing
Author
Kiselyov, B.S. ; Kulakov, N. Yu ; Mikaelian, A.L.
Author_Institution
Acad. of Sci., Moscow, Russia
fYear
1992
Firstpage
37
Abstract
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
Keywords
learning systems; operations research; optical information processing; simulated annealing; assignment problem; combinatorial optimization; fluctuations; learning machines; optical implementations; optimal work distribution; problem solving computation time; rearrangements; simulated annealing; Cost function; Probability; Simulated annealing; Temperature;
fLanguage
English
Publisher
ieee
Conference_Titel
Neuroinformatics and Neurocomputers, 1992., RNNS/IEEE Symposium on
Conference_Location
Rostov-on-Don
Print_ISBN
0-7803-0809-3
Type
conf
DOI
10.1109/RNNS.1992.268612
Filename
268612
Link To Document