Related articles:
Hill climbing
Monte Carlo method
Ant colony optimization
Key terms:
tt
sa
moves
neighbour
probability
generator
algorithm
candidate
graph
simulated annealing
swaps
analogy
optimization
acceptance
parameters
heuristic
downhill
current state
sa algorithm
greedy
each step
optimum
lower energy
thermodynamic
randomly
implementations
physical system
iteration
candidate moves
annealing schedule
cooling schedule
local minimum
stochastic
candidate generator
search graph
search space
local minima
uphill moves
initial state
best solution
probabilistic
internal energy
energy function
transition probability
consecutive cities
difference between
acceptance function
traveling salesman problem
acceptance probability function
simulated annealing algorithm
Search external links cited by footnotes on Wikipedia page Simulated annealing:
|
|