International Series in Operations Research &Amp; Management Science
DOI: 10.1007/0-306-48056-5_10
|View full text |Cite
|
Sign up to set email alerts
|

The Theory and Practice of Simulated Annealing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
210
0
8

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 346 publications
(218 citation statements)
references
References 103 publications
0
210
0
8
Order By: Relevance
“…For example, the size of the neighborhood should not be too small compared with the total solution space cardinality because the process might not occur sufficiently fast. 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.…”
Section: Working Principlesmentioning
confidence: 99%
See 1 more Smart Citation
“…For example, the size of the neighborhood should not be too small compared with the total solution space cardinality because the process might not occur sufficiently fast. 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.…”
Section: Working Principlesmentioning
confidence: 99%
“…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%
“…GehadIsmail_FCI@yahoo.com Aboul Ella Hassanien aboitcairo@gmail.com 1 Faculty of Computers and Information, Cairo University, Cairo, Egypt 2 Scientific Research Group in Egypt (SRGE), Cairo, Egypt ever, this kind of modifications in SA schema does not usually inherit the ability of SA for escaping from local optima [11]. On the other hand, population-based meta-heuristics algorithms equipped with the ability to guide their search through using intelligent learning mechanism.…”
Section: B Gehad Ismail Sayedmentioning
confidence: 99%
“…Marxan was originally conceived to solve a specific problem referred to as "the minimum set problem", in order to get some minimum representation of biodiversity resources for the lowest possible cost (Possingham el al., 2006). Marxan uses the simulated annealing algorithm, which is a local search algorithm (meta-heuristic) for global optimization problems (Henderson et al, 2003). The spatial optimization process built into Marxan, selects an optimal network of conservation sites that achieves conservation goals, minimizing a set of costs, by estimating, for each planning unit, the external design constraints and thus avoiding costly planning units (Lagrabrielle et al, 2010).…”
Section: Figura 7 Diferenças Do Valor De Conservação (Considerando Amentioning
confidence: 99%