1988
DOI: 10.1016/0920-5632(88)90023-0
|View full text |Cite
|
Sign up to set email alerts
|

Simulated annealing: A review of the thermodynamic approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

1993
1993
2020
2020

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(4 citation statements)
references
References 16 publications
0
4
0
Order By: Relevance
“…(Note that there also exist more complex forms of simulated annealing where an ensemble of random walkers share or exchange statistical information about the misfit surface. See, for example, Harland and Salamon [1988], Hoffmann et al . [1990], Mosegaard and Vestergaard [1991], and Ruppeiner et al ., [1991]).…”
Section: Monte Carlo Methods: the Technology Of Informationmentioning
confidence: 99%
See 1 more Smart Citation
“…(Note that there also exist more complex forms of simulated annealing where an ensemble of random walkers share or exchange statistical information about the misfit surface. See, for example, Harland and Salamon [1988], Hoffmann et al . [1990], Mosegaard and Vestergaard [1991], and Ruppeiner et al ., [1991]).…”
Section: Monte Carlo Methods: the Technology Of Informationmentioning
confidence: 99%
“…40, 3 / REVIEWS OF GEOPHYSICS the misfit surface. See, for example, Harland andSalamon [1988], Hoffmann et al [1990], Mosegaard and Vestergaard [1991], and Ruppeiner et al, [1991]). The early history of GAs in the Earth sciences has been traced above.…”
Section: Genetic Algorithmsmentioning
confidence: 99%
“…The value of the amplitudes ψ 0,n and the stripe momentum k 1 can be obtained by minimizing the mean-field energy. We do that using the Simulated Annealing algorithm [19]. The effect of quantum fluctuations can be included following the Bogoliubov scheme.…”
mentioning
confidence: 99%
“…SA is a local search-based algorithm able to bypass local optima because it searches not only for trial solutions that may reduce the cost function, but also allows moves leading to increase the objective function value. This mechanism may avoid the optimization search being trapped prematurely in a local minimum [10].…”
Section: Introductionmentioning
confidence: 99%