1986
DOI: 10.1080/00401706.1986.10488128
|View full text |Cite
|
Sign up to set email alerts
|

Generalized Simulated Annealing for Function Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
165
0
5

Year Published

1990
1990
2017
2017

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 324 publications
(175 citation statements)
references
References 13 publications
0
165
0
5
Order By: Relevance
“…with a fixed parameter θ, the χ 2 n of the previously accepted step, and the χ 2 * of the global optimum (Bohachevsky et al 1986;Locatelli 2000). The latter value is typically unknown and one has to resort to a lower bound or sensible approximation for χ 2 * like the χ 2 of the current best-fit of an individual run.…”
Section: Simulated Annealingmentioning
confidence: 99%
“…with a fixed parameter θ, the χ 2 n of the previously accepted step, and the χ 2 * of the global optimum (Bohachevsky et al 1986;Locatelli 2000). The latter value is typically unknown and one has to resort to a lower bound or sensible approximation for χ 2 * like the χ 2 of the current best-fit of an individual run.…”
Section: Simulated Annealingmentioning
confidence: 99%
“…They include adaptive random search [Pronzato et al (1984)], genetic algorithms [Goldberg (1989)], the filled function method [Renpu (1990)], multi level methods [Kan and Timmer (1987)] and a method using stochastic differential equations [Aluffi-Pentini et al (1988)]. Both Vanderbilt et al (1984) and Bohachevsky et al (1986) have modified simulated annealing for continuous variable problems.…”
Section: B Simulated Annealing For Continuous Variable Problemsmentioning
confidence: 99%
“…This algorithm is a set of rules for searching large solution spaces in a manner that mimics the annealing process of metals. The algorithm simulates the behavior of an ensemble of atoms in equilibrium at a given finite temperature and its original framework can be traced to Metropolis [14]. This algorithm has been regularly used in global function optimisation and statistical applications.…”
Section: B Simulated Annealing (Sa)mentioning
confidence: 99%