2000
DOI: 10.1016/s0305-0548(99)00054-4
|View full text |Cite
|
Sign up to set email alerts
|

Experiments with new stochastic global optimization search techniques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
18
0

Year Published

2004
2004
2018
2018

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 41 publications
(18 citation statements)
references
References 40 publications
0
18
0
Order By: Relevance
“…In the 1980s, the SA algorithm had a major impact on the field of heuristic search for its simplicity and efficiency in solving combinatorial optimization problems. Moreover, the SA algorithm has been extended to deal with continuous optimization problems [7][8][9].…”
Section: Simulated Annealing-based Optimization Procedurementioning
confidence: 99%
“…In the 1980s, the SA algorithm had a major impact on the field of heuristic search for its simplicity and efficiency in solving combinatorial optimization problems. Moreover, the SA algorithm has been extended to deal with continuous optimization problems [7][8][9].…”
Section: Simulated Annealing-based Optimization Procedurementioning
confidence: 99%
“…In the 80's, SA had a major impact on the field of heuristic search for its simplicity and efficiency for solving combinatorial optimization problems. Then, it has been extended to deal with continuous optimization problems (Dekkers and Aarts, 1991;Ozdamar and Demirhan, 2000;Locatelli, 2000). SA is a stochastic algorithm which enables under some conditions the degradation of a solution.…”
Section: Simulated Annealingmentioning
confidence: 99%
“…However, simulated annealing algorithms for continuous variables have been proposed by fewer authors than for discrete variables [15]. Some more recent gradient-free optimization methods for continuous variables involving simulated annealing are presented, for example, in [15][16][17][18][19][20][21][22]41]. Some of these methods are hybrids, where simulated annealing is combined with a local search method.…”
Section: Introductionmentioning
confidence: 99%
“…On the second level, another parallel synchronous hybrid is used, where the first-level hybrid is combined with simulated annealing. An excellent study of 13 different variants of gradient-free simulated annealing is presented in [19], where, among others, simulated annealing is hybridized with a local search and clustering and partitioning techniques. Some of these methods are parallel synchronous and some are parallel asynchronous hybrids.…”
Section: Introductionmentioning
confidence: 99%