2019
DOI: 10.1016/j.procs.2019.01.230
|View full text |Cite
|
Sign up to set email alerts
|

Study on stealth characteristics of metamaterials based on simulated annealing algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…Simulated annealing is an algorithm that simulates the solid annealing process. Such a process includes the coding of the solution, an annealing temperature, the energy function, generation and acceptance of a new solution, and the length of the Markov chain (Liu et al, 2019). Detailed descriptions are as follows.…”
Section: Solution Algorithmmentioning
confidence: 99%
“…Simulated annealing is an algorithm that simulates the solid annealing process. Such a process includes the coding of the solution, an annealing temperature, the energy function, generation and acceptance of a new solution, and the length of the Markov chain (Liu et al, 2019). Detailed descriptions are as follows.…”
Section: Solution Algorithmmentioning
confidence: 99%
“…r 1 () and r 2 () are random Numbers in the range of 0-1; v max d is the maximum speed; Δt is the time interval. The starting point of simulated annealing algorithm 22 for optimization problems is based on the similarity between the annealing process of solid substances in physics and general optimization problems. In Aslett et al, 23 the acceptance criterion allows the target function to go bad rather than according to probability, but directly presses ΔE < e, where ΔE is the change in the adaptive value caused by the two positions, and e is the range of the allowed target function to go bad.…”
Section: Introductionmentioning
confidence: 99%