2008
DOI: 10.1007/978-3-540-85984-0_90
|View full text |Cite
|
Sign up to set email alerts
|

Cloud Theory Based Simulated Annealing Algorithm for Multiple Observers Sitting on Terrain Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 3 publications
0
2
0
Order By: Relevance
“…The third proposed algorithm for signature hosting concentrates on using a semiheuristic search through a simulated annealing (SA) algorithm [ 31 ]. SA was introduced more than twenty years ago, and since then it has been considered a useful tool for a variety of optimization problems in various fields [ 32 34 ]. The main feature provided by SA over other algorithms is its ability to avoid local minima by controlling the acceptance of cost-increasing neighbours by means of a probability, which decreases as the search algorithm progresses.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The third proposed algorithm for signature hosting concentrates on using a semiheuristic search through a simulated annealing (SA) algorithm [ 31 ]. SA was introduced more than twenty years ago, and since then it has been considered a useful tool for a variety of optimization problems in various fields [ 32 34 ]. The main feature provided by SA over other algorithms is its ability to avoid local minima by controlling the acceptance of cost-increasing neighbours by means of a probability, which decreases as the search algorithm progresses.…”
Section: Methodsmentioning
confidence: 99%
“…Thus, a particular solution involving an increase in the cost function is accepted with probability: where δ is the cost difference and t is the control parameter corresponding to the temperature in the physical analogy [ 35 ], so it is usually called temperature. The algorithm requires a careful adjustment in order to avoid high execution times [ 32 ] while maintaining the quality of the solution.…”
Section: Methodsmentioning
confidence: 99%