2006 IEEE Conference on Cybernetics and Intelligent Systems 2006
DOI: 10.1109/iccis.2006.252256
|View full text |Cite
|
Sign up to set email alerts
|

Simulated Annealing using an Adaptive Search Vector

Abstract: Abstract-It is reported that simulated annealing (SA), which changes one design variable at a time, is effective when applied to high-dimensional continuous optimization problems. However, if a correlation exists among the design variables, it is not efficient to search each dimension. In this paper, we propose SA with a mechanism to determine an appropriate search direction according to the landscape of the given problems. Its effectiveness is verified for high-dimensional problems with correlation among desi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 7 publications
0
5
0
Order By: Relevance
“…Simulated Annealing Algorithm is a simple and effective metaheuristic optimization algorithm for solving optimization problems in large search domains. In fact, this Algorithm applies to issues that finding an approximate response for general optimization, is more important than finding a precise response to local optimum at a limited and specific time [5] . The gradual Annealing technique is used by metallurgists to achieve a state in which the solid is well-developed and its energy is minimized.…”
Section: Description Of the Simulated Annealing (Sa)mentioning
confidence: 99%
See 1 more Smart Citation
“…Simulated Annealing Algorithm is a simple and effective metaheuristic optimization algorithm for solving optimization problems in large search domains. In fact, this Algorithm applies to issues that finding an approximate response for general optimization, is more important than finding a precise response to local optimum at a limited and specific time [5] . The gradual Annealing technique is used by metallurgists to achieve a state in which the solid is well-developed and its energy is minimized.…”
Section: Description Of the Simulated Annealing (Sa)mentioning
confidence: 99%
“…In 2009, the problem of covering the points with two Isothetic rectangles was defined by Saha and Dos [5] . A set of n points in the page is covered by two Isothetic rectangles at any arbitrarily orientation.…”
Section: Research Backgroundmentioning
confidence: 99%
“…It is inspired from thermodynamics to simulate the physical process of annealing of molten metals [26,27]. It obtains the minimum value of energy by simulating annealing which is a process employed to obtain an impeccable crystal by gradual cooling of molten metals in order to keep the system of melt in a thermodynamic equilibrium at a given temperature [28]. Thus, it exploits an analogy between the way in which a metal cools and freezes into a minimum energy crystalline structure.…”
Section: Simulated Annealingmentioning
confidence: 99%
“…It is inspired from thermodynamic to simulate the physical process of annealing of molten metals [27,28]. It obtains the minimum value of energy by simulating annealing which is a process employed to obtain a perfect crystal by gradual cooling of molten metals in order to keep the system of melt in a thermodynamic equilibrium at given temperature [29]. Thus, it exploits an analogy between the way in which a metal cools and freezes into a minimum energy crystalline structure.…”
Section: Simulated Annealingmentioning
confidence: 99%