Implementation of an adaptive, constant thermodynamic speed simulated annealing schedule
1988; Elsevier BV; Volume: 5; Issue: 1 Linguagem: Inglês
10.1016/0920-5632(88)90024-2
ISSN1873-3832
Autores Tópico(s)Graph Theory and Algorithms
ResumoWe present a new implementation of simulated annealing. It calculates its own cooling schedule from thermodynamic information computed enroute. Our schedule proceeds at constant “thermodynamic speed” to minimize the entropy produced along the way. It is based on finite time thermodynamics and is, in some sense, optimal. We use ensembles over the entire configuration space to compute thermodynamic averages. Ensembles provide good statistics for the thermodynamic process as well as a direct, instantaneous measures of the nature of the configuration space with Hamming distances. We compare our implementation with some others on a random graph problem. It is found to produce superior results.
Referência(s)