Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 27777

For questions related to the simulated annealing algorithm (SA), which is a probabilistic algorithm that attempts to find the global optimum of a function. SA can e.g. be used to solve the travelling salesman problem (TSP).

1 vote
2 answers
255 views

Why does Simulated Annealing not take worse solution if the energy difference becomes higher?

In Simulated Annealing, a worse solution is accepted with this probability: $$p=e^{-\frac{E(y)-E(x)}{kT}}.$$ If that understanding is correct: Why is this probability function used? This means that, t …
MScott's user avatar
  • 445
1 vote
1 answer
74 views

What are most commons methods to measure improvement rate in a meta-heuristic?

When I run a meta-heuristics, like a Genetic Algorithm or a Simulated Annealing, I want to have a termination criterion that stops the algorithms when there is not any significant fitness improvement. …
MScott's user avatar
  • 445