Simulated Annealing - Advances, Applications and Hybridizations 2012
DOI: 10.5772/50302
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive Neighborhood Heuristics for Simulated Annealing over Continuous Variables

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
3
0
1

Year Published

2014
2014
2020
2020

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 14 publications
0
3
0
1
Order By: Relevance
“…Nevertheless, if the size of the neighborhood is too large, the algorithm might not be able to focus on specific areas (Henderson et al 2003). Adaptive neighborhoods have been proposed by several authors (Martins et al 2012;Yao 1993;Liu 1999) in which the size of the neighborhood changes according to the previously visited solutions. Finally, it was concluded that the neighborhood is heavily problem-specific (Henderson et al 2003).…”
Section: Working Principlesmentioning
confidence: 99%
“…Nevertheless, if the size of the neighborhood is too large, the algorithm might not be able to focus on specific areas (Henderson et al 2003). Adaptive neighborhoods have been proposed by several authors (Martins et al 2012;Yao 1993;Liu 1999) in which the size of the neighborhood changes according to the previously visited solutions. Finally, it was concluded that the neighborhood is heavily problem-specific (Henderson et al 2003).…”
Section: Working Principlesmentioning
confidence: 99%
“…x current = x new ; T = αT ▷ Reduce the temperature 19: end while lead to generating more efficient new solutions in SA is the crystallization heuristic [94]. For a continuous variable, the crystallization heuristic controls the probability of density distribution.…”
Section: Methodology and Resultsmentioning
confidence: 99%
“…The step size ∆r i depends on the search interval and can be estimated by Eq. (3.2) with enough exploration [94].…”
Section: Methodology and Resultsmentioning
confidence: 99%
“…De acordo com Martins et al [2012], a estratégia utilizada por Corana et al [1987] pode não ser a melhor estratégia para se avaliar o comportamento da função objetivo em diferentes direções, por isto, Martins et al [2012] propuseram um algoritmo de recozimento simulado com vizinhança adaptativa (Algoritmo 1). É conhecido que soluções rejeitadas não contribuem para o avanço do algoritmo do recozimento simulado, a distribuição de probabilidade é ajustada conforme o número de soluções aceitas.…”
Section: Vizinhança Adaptativa E Fator De Cristalizaçãounclassified